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-171683760700266.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 ShieldIIPt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760700266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 167K 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 ShieldIIPt-PT-010B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716930618221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 21:10:19] [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-28 21:10:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:10:19] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-28 21:10:19] [INFO ] Transformed 703 places.
[2024-05-28 21:10:19] [INFO ] Transformed 653 transitions.
[2024-05-28 21:10:19] [INFO ] Found NUPN structural information;
[2024-05-28 21:10:19] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 149 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 653/653 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 635 transition count 585
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 635 transition count 585
Applied a total of 136 rules in 105 ms. Remains 635 /703 variables (removed 68) and now considering 585/653 (removed 68) transitions.
// Phase 1: matrix 585 rows 635 cols
[2024-05-28 21:10:19] [INFO ] Computed 91 invariants in 22 ms
[2024-05-28 21:10:20] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-28 21:10:20] [INFO ] Invariant cache hit.
[2024-05-28 21:10:20] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-28 21:10:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/635 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 8 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:10:31] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 4 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:10:32] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:10:33] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:10:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:10:33] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 4 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:10:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-28 21:10:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:10:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:10:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:10:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:10:42] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:10:42] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 4 ms to minimize.
[2024-05-28 21:10:42] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 5 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:10:43] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:10:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:10:46] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-28 21:10:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:10:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:10:47] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
[2024-05-28 21:10:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:10:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:10:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:10:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:10:49] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-28 21:10:49] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-28 21:10:49] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:10:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/1220 variables, and 171 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/635 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:10:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:10:58] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:10:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:10:58] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:10:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:11:00] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:11:04] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:11:04] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:11:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:11:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:11:06] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:11:08] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:11:09] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:11:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:11:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:11:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:11:12] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:11:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 13/224 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-28 21:11:18] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:11:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:11:18] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/1220 variables, and 227 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 136/136 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 635/703 places, 585/653 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61140 ms. Remains : 635/703 places, 585/653 transitions.
Support contains 149 out of 635 places after structural reductions.
[2024-05-28 21:11:21] [INFO ] Flatten gal took : 65 ms
[2024-05-28 21:11:21] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:11:21] [INFO ] Input system was already deterministic with 585 transitions.
Support contains 146 out of 635 places (down from 149) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2268 ms. (17 steps per ms) remains 6/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
[2024-05-28 21:11:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 330/343 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 292/635 variables, 47/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 585/1220 variables, 635/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1220 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 726 constraints, problems are : Problem set: 0 solved, 5 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 330/343 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 21:11:22] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 21:11:22] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:11:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 292/635 variables, 47/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-28 21:11:23] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 585/1220 variables, 635/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1220 variables, 5/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 21:11:24] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1220 variables, 11/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 21:11:25] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1220 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1220 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 758 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 635/635 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 27/27 constraints]
After SMT, in 4155ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 2967 ms.
Support contains 9 out of 635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 635/635 places, 585/585 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 635 transition count 453
Reduce places removed 132 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 134 rules applied. Total rules applied 266 place count 503 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 268 place count 501 transition count 451
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 268 place count 501 transition count 395
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 380 place count 445 transition count 395
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 406 place count 419 transition count 369
Iterating global reduction 3 with 26 rules applied. Total rules applied 432 place count 419 transition count 369
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 432 place count 419 transition count 351
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 468 place count 401 transition count 351
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 802 place count 234 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 803 place count 234 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 805 place count 233 transition count 182
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 857 place count 207 transition count 196
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 858 place count 207 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 859 place count 207 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 860 place count 206 transition count 194
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 870 place count 206 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 871 place count 205 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 873 place count 203 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 873 place count 203 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 875 place count 202 transition count 192
Applied a total of 875 rules in 123 ms. Remains 202 /635 variables (removed 433) and now considering 192/585 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 202/635 places, 192/585 transitions.
RANDOM walk for 40000 steps (8 resets) in 917 ms. (43 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
// Phase 1: matrix 192 rows 202 cols
[2024-05-28 21:11:29] [INFO ] Computed 89 invariants in 2 ms
[2024-05-28 21:11:29] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/109 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/224 variables, 109/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 44/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 44/268 variables, 22/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/270 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 48/318 variables, 26/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/323 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/323 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/323 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/325 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 32/357 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/357 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/357 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/359 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/359 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/359 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/361 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/361 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 16/377 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/377 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/377 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 9/386 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/386 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/386 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/386 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/387 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/387 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/387 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/388 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/388 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/388 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/394 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/394 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/394 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/394 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 202/202 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/109 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:11:30] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/224 variables, 109/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 44/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/268 variables, 22/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 10/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/270 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 48/318 variables, 26/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/318 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/323 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/323 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/323 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/325 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/325 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 32/357 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/357 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/357 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/359 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/359 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/359 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/361 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/361 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 16/377 variables, 10/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/377 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/377 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 9/386 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/386 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/386 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/386 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1/387 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/387 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/387 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/388 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/388 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/388 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/394 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/394 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/394 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/394 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 202/202 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 202 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 200 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 200 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 199 transition count 189
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 195 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 193 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 192 transition count 187
Applied a total of 19 rules in 36 ms. Remains 192 /202 variables (removed 10) and now considering 187/192 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 192/202 places, 187/192 transitions.
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 969080 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 969080 steps, saw 630922 distinct states, run finished after 3005 ms. (steps per millisecond=322 ) properties seen :0
// Phase 1: matrix 187 rows 192 cols
[2024-05-28 21:11:33] [INFO ] Computed 89 invariants in 2 ms
[2024-05-28 21:11:33] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/64 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/116 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 67/183 variables, 32/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/186 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/190 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/252 variables, 32/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/252 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/253 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/253 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/255 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/255 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 58/313 variables, 30/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/313 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/313 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/314 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/314 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/314 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/316 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/316 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 49/365 variables, 28/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/365 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/365 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/365 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 3/368 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/368 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/368 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 1/369 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/369 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/369 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 10/379 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/379 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/379 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/379 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 291 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 192/192 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/64 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/116 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 67/183 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/186 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/190 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/252 variables, 32/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/252 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/252 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/253 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/253 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/253 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/255 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/255 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 58/313 variables, 30/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/313 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/313 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/314 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/314 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/314 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/316 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/316 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 49/365 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/365 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/365 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/365 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 3/368 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/368 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/368 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/369 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/369 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/369 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/379 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/379 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/379 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/379 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 192/192 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-28 21:11:33] [INFO ] Invariant cache hit.
[2024-05-28 21:11:34] [INFO ] Implicit Places using invariants in 108 ms returned [181]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 191/192 places, 187/187 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 190 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 190 transition count 186
Applied a total of 2 rules in 9 ms. Remains 190 /191 variables (removed 1) and now considering 186/187 (removed 1) transitions.
// Phase 1: matrix 186 rows 190 cols
[2024-05-28 21:11:34] [INFO ] Computed 88 invariants in 2 ms
[2024-05-28 21:11:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 21:11:34] [INFO ] Invariant cache hit.
[2024-05-28 21:11:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-28 21:11:34] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 190/192 places, 186/187 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 410 ms. Remains : 190/192 places, 186/187 transitions.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1013714 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1013714 steps, saw 660416 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-05-28 21:11:37] [INFO ] Invariant cache hit.
[2024-05-28 21:11:37] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/64 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/116 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 67/183 variables, 32/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/186 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/190 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/252 variables, 32/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/252 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/253 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/253 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/255 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/255 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 58/313 variables, 30/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/313 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/313 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/314 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/314 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/314 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/316 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/316 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 48/364 variables, 28/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/364 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/364 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/366 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/366 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 10/376 variables, 8/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/376 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/376 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/376 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/64 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/116 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 67/183 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/186 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/190 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/252 variables, 32/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/252 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/252 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/253 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/253 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/253 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/255 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/255 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 58/313 variables, 30/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/313 variables, 13/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/313 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/314 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/314 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/314 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/316 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/316 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 48/364 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/364 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/366 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/366 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/366 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 10/376 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/376 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/376 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/376 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 186/186 transitions.
Applied a total of 0 rules in 7 ms. Remains 190 /190 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 190/190 places, 186/186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 186/186 transitions.
Applied a total of 0 rules in 5 ms. Remains 190 /190 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2024-05-28 21:11:37] [INFO ] Invariant cache hit.
[2024-05-28 21:11:37] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 21:11:37] [INFO ] Invariant cache hit.
[2024-05-28 21:11:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-28 21:11:38] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-28 21:11:38] [INFO ] Redundant transitions in 6 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-28 21:11:38] [INFO ] Invariant cache hit.
[2024-05-28 21:11:38] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 186/376 variables, 190/278 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 287 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4895 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 186/376 variables, 190/278 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 182/469 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 469 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6473 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 11404ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 11407ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11710 ms. Remains : 190/190 places, 186/186 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 190 transition count 186
Applied a total of 23 rules in 10 ms. Remains 190 /190 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 190 cols
[2024-05-28 21:11:49] [INFO ] Computed 88 invariants in 4 ms
[2024-05-28 21:11:49] [INFO ] [Real]Absence check using 88 positive place invariants in 10 ms returned sat
[2024-05-28 21:11:49] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:11:49] [INFO ] [Nat]Absence check using 88 positive place invariants in 9 ms returned sat
[2024-05-28 21:11:49] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:11:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-28 21:11:49] [INFO ] After 14ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:11:49] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:11:49] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 312 ms.
[2024-05-28 21:11:49] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:11:49] [INFO ] Flatten gal took : 51 ms
[2024-05-28 21:11:49] [INFO ] Input system was already deterministic with 585 transitions.
Computed a total of 174 stabilizing places and 174 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 594 transition count 544
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 592 transition count 542
Applied a total of 86 rules in 44 ms. Remains 592 /635 variables (removed 43) and now considering 542/585 (removed 43) transitions.
// Phase 1: matrix 542 rows 592 cols
[2024-05-28 21:11:50] [INFO ] Computed 91 invariants in 7 ms
[2024-05-28 21:11:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 21:11:50] [INFO ] Invariant cache hit.
[2024-05-28 21:11:50] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-28 21:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:11:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:12:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:12:01] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:12:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:12:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:12:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:12:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:12:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:12:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:12:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:12:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:12:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:12:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:12:15] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:12:15] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:12:15] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:12:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:12:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1134 variables, and 171 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:26] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:12:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:12:27] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:12:27] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:12:28] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:12:28] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:12:30] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:12:34] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:12:35] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (OVERLAPS) 542/1134 variables, 592/781 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 541/1322 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:12:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:12:45] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:12:46] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 4 ms to minimize.
[2024-05-28 21:12:46] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:12:46] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:12:47] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 4 ms to minimize.
[2024-05-28 21:12:47] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 4 ms to minimize.
[2024-05-28 21:12:47] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:12:48] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2024-05-28 21:12:49] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 4 ms to minimize.
[2024-05-28 21:12:49] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 4 ms to minimize.
[2024-05-28 21:12:49] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:12:50] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 4 ms to minimize.
[2024-05-28 21:12:50] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 1339 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 115/115 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 592/635 places, 542/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60699 ms. Remains : 592/635 places, 542/585 transitions.
[2024-05-28 21:12:50] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:12:50] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:12:50] [INFO ] Input system was already deterministic with 542 transitions.
[2024-05-28 21:12:50] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:12:50] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:12:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4785880843505426234.gal : 10 ms
[2024-05-28 21:12:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8524850504260797778.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/CTLFireability4785880843505426234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8524850504260797778.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-28 21:13:20] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:13:20] [INFO ] Applying decomposition
[2024-05-28 21:13:20] [INFO ] Flatten gal took : 17 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/graph3999178686267540180.txt' '-o' '/tmp/graph3999178686267540180.bin' '-w' '/tmp/graph3999178686267540180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3999178686267540180.bin' '-l' '-1' '-v' '-w' '/tmp/graph3999178686267540180.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:13:21] [INFO ] Decomposing Gal with order
[2024-05-28 21:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:13:21] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-28 21:13:21] [INFO ] Flatten gal took : 72 ms
[2024-05-28 21:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 21:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10155841265832803910.gal : 8 ms
[2024-05-28 21:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4831333413246404575.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/CTLFireability10155841265832803910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4831333413246404575.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 634 transition count 450
Reduce places removed 134 places and 0 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 268 place count 500 transition count 450
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 268 place count 500 transition count 391
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 386 place count 441 transition count 391
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 410 place count 417 transition count 367
Iterating global reduction 2 with 24 rules applied. Total rules applied 434 place count 417 transition count 367
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 434 place count 417 transition count 351
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 466 place count 401 transition count 351
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 780 place count 244 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 781 place count 244 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 783 place count 243 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 785 place count 241 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 787 place count 239 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 787 place count 239 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 789 place count 238 transition count 189
Applied a total of 789 rules in 84 ms. Remains 238 /635 variables (removed 397) and now considering 189/585 (removed 396) transitions.
// Phase 1: matrix 189 rows 238 cols
[2024-05-28 21:13:51] [INFO ] Computed 89 invariants in 1 ms
[2024-05-28 21:13:51] [INFO ] Implicit Places using invariants in 147 ms returned [224]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 237/635 places, 189/585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 188
Applied a total of 2 rules in 8 ms. Remains 236 /237 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 236 cols
[2024-05-28 21:13:51] [INFO ] Computed 88 invariants in 9 ms
[2024-05-28 21:13:51] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 21:13:51] [INFO ] Invariant cache hit.
[2024-05-28 21:13:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 236/635 places, 188/585 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 635 ms. Remains : 236/635 places, 188/585 transitions.
[2024-05-28 21:13:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:13:52] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:13:52] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-28 21:13:52] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:13:52] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:13:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7405538943583418410.gal : 2 ms
[2024-05-28 21:13:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3299626440128787221.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/CTLFireability7405538943583418410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3299626440128787221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45309e+35,0.312346,14860,2,1550,5,49548,6,0,1133,69964,0


Converting to forward existential form...Done !
original formula: A((A(((p166==1)&&(p168==1)) U ((p40!=1)||(p163==1))) + !(A(!(E((p412==1) U (p264==1))) U ((((p177!=1)&&(p374==1))&&(p413==1))||(!((p430==...197
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(E(TRUE U !(E(TRUE U (p60==1)))))))))) * !(E(!(!(!(E(TRUE U !(E(TRUE U (p60==1))))))) U (!((...594
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t9, t11, t14, t15, t16, t17, t18, t48, t50, t51, t54, t56, t59, t61, t64,...379
Detected timeout of ITS tools.
[2024-05-28 21:14:22] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:14:22] [INFO ] Applying decomposition
[2024-05-28 21:14:22] [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/graph15420463560097016152.txt' '-o' '/tmp/graph15420463560097016152.bin' '-w' '/tmp/graph15420463560097016152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15420463560097016152.bin' '-l' '-1' '-v' '-w' '/tmp/graph15420463560097016152.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:14:22] [INFO ] Decomposing Gal with order
[2024-05-28 21:14:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:14:22] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-28 21:14:22] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:14:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:14:22] [INFO ] Time to serialize gal into /tmp/CTLFireability472809833112043089.gal : 6 ms
[2024-05-28 21:14:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3876459605219642297.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/CTLFireability472809833112043089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3876459605219642297.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45309e+35,0.319357,12320,334,56,17267,235,499,42976,69,1284,0


Converting to forward existential form...Done !
original formula: A((A(((i3.i0.u18.p166==1)&&(i3.i0.u18.p168==1)) U ((i0.i2.u5.p40!=1)||(i3.i0.u18.p163==1))) + !(A(!(E((i8.u49.p412==1) U (i4.i1.u31.p264=...307
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(E(TRUE U !(E(TRUE U (i0.i0.u7.p60==1)))))))))) * !(E(!(!(!(E(TRUE U !(E(TRUE U (i0.i0.u7.p6...850
Reverse transition relation is NOT exact ! Due to transitions t170, t174, i0.i0.u7.t17, i0.i0.u7.t51, i0.i1.u6.t50, i0.i1.u8.t54, i0.i2.u2.t0, i0.i2.u5.t18...772
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 596 transition count 546
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 596 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 595 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 595 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 594 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 594 transition count 544
Applied a total of 82 rules in 52 ms. Remains 594 /635 variables (removed 41) and now considering 544/585 (removed 41) transitions.
// Phase 1: matrix 544 rows 594 cols
[2024-05-28 21:14:52] [INFO ] Computed 91 invariants in 9 ms
[2024-05-28 21:14:52] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-28 21:14:52] [INFO ] Invariant cache hit.
[2024-05-28 21:14:52] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-28 21:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:01] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:15:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:15:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 4 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:15:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 4 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:15:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:04] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:15:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:15:05] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:15:06] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:15:07] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:15:13] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:15:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:15:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:15:13] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:15:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:15:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:15:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:15:15] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-28 21:15:15] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:15:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-28 21:15:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:15:19] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:15:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1138 variables, and 171 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/594 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:28] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-28 21:15:28] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:15:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:15:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-28 21:15:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:15:30] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:15:31] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:15:32] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:15:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:15:32] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:15:32] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-05-28 21:15:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:15:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (OVERLAPS) 544/1138 variables, 594/784 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 543/1327 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:15:47] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-28 21:15:47] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:15:48] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:15:49] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-05-28 21:15:49] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-28 21:15:49] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:15:50] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:15:50] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 4 ms to minimize.
[2024-05-28 21:15:51] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:15:51] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 3 ms to minimize.
[2024-05-28 21:15:52] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:15:52] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:15:52] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 60077ms, After SMT, problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 594/635 places, 544/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60681 ms. Remains : 594/635 places, 544/585 transitions.
[2024-05-28 21:15:52] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:15:52] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:15:52] [INFO ] Input system was already deterministic with 544 transitions.
[2024-05-28 21:15:53] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:15:53] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12048522302442897944.gal : 9 ms
[2024-05-28 21:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13613623252035461817.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/CTLFireability12048522302442897944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13613623252035461817.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-28 21:16:23] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:16:23] [INFO ] Applying decomposition
[2024-05-28 21:16:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1360124381473137959.txt' '-o' '/tmp/graph1360124381473137959.bin' '-w' '/tmp/graph1360124381473137959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1360124381473137959.bin' '-l' '-1' '-v' '-w' '/tmp/graph1360124381473137959.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:16:23] [INFO ] Decomposing Gal with order
[2024-05-28 21:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:16:23] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-28 21:16:23] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:16:23] [INFO ] Time to serialize gal into /tmp/CTLFireability375061911172832947.gal : 6 ms
[2024-05-28 21:16:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10277684335047519618.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/CTLFireability375061911172832947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10277684335047519618.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 594 transition count 544
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Applied a total of 84 rules in 28 ms. Remains 593 /635 variables (removed 42) and now considering 543/585 (removed 42) transitions.
// Phase 1: matrix 543 rows 593 cols
[2024-05-28 21:16:53] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 21:16:53] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-28 21:16:53] [INFO ] Invariant cache hit.
[2024-05-28 21:16:53] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-05-28 21:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:02] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:17:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:04] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:06] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 3 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:17:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:17:08] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:14] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:17:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-28 21:17:16] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-28 21:17:20] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:17:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:17:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:21] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:17:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1136 variables, and 172 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:30] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:17:30] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:17:31] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:17:32] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:17:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:17:33] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:17:33] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 13/185 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:17:37] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:17:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:17:38] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 7/192 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:17:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:17:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/1136 variables, and 195 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 0/542 constraints, Known Traps: 104/104 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 593/635 places, 543/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 593/635 places, 543/585 transitions.
[2024-05-28 21:17:54] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:17:54] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:17:54] [INFO ] Input system was already deterministic with 543 transitions.
[2024-05-28 21:17:54] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:17:54] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:17:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5159768603334431267.gal : 2 ms
[2024-05-28 21:17:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16579025091688560911.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/CTLFireability5159768603334431267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16579025091688560911.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-28 21:18:24] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:18:24] [INFO ] Applying decomposition
[2024-05-28 21:18:24] [INFO ] Flatten gal took : 12 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/graph17323552479611792257.txt' '-o' '/tmp/graph17323552479611792257.bin' '-w' '/tmp/graph17323552479611792257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17323552479611792257.bin' '-l' '-1' '-v' '-w' '/tmp/graph17323552479611792257.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:18:24] [INFO ] Decomposing Gal with order
[2024-05-28 21:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:18:24] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 21:18:24] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:18:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4718834078869863616.gal : 5 ms
[2024-05-28 21:18:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8838262494144317106.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/CTLFireability4718834078869863616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8838262494144317106.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 597 transition count 547
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 597 transition count 547
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 596 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 596 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 595 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 595 transition count 545
Applied a total of 80 rules in 32 ms. Remains 595 /635 variables (removed 40) and now considering 545/585 (removed 40) transitions.
// Phase 1: matrix 545 rows 595 cols
[2024-05-28 21:18:54] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 21:18:54] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-28 21:18:54] [INFO ] Invariant cache hit.
[2024-05-28 21:18:55] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2024-05-28 21:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:03] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:19:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:19:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:19:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 4 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:19:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 20 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:19:05] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:19:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:19:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:19:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:19:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-28 21:19:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-28 21:19:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:19:19] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:19:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:19:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:19:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:19:20] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:19:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:19:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:19:21] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:19:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:19:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:19:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1140 variables, and 173 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (OVERLAPS) 1/595 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 82/173 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:31] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:19:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:19:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:19:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:19:33] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:19:34] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 18/191 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:39] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 7 (OVERLAPS) 545/1140 variables, 595/788 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1140 variables, 544/1332 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-28 21:19:54] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:19:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 1334 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 595/595 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 104/104 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 595/635 places, 545/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 595/635 places, 545/585 transitions.
[2024-05-28 21:19:55] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:19:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:19:55] [INFO ] Input system was already deterministic with 545 transitions.
[2024-05-28 21:19:55] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:19:55] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3173081851936061702.gal : 3 ms
[2024-05-28 21:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6076501896440705933.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/CTLFireability3173081851936061702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6076501896440705933.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-28 21:20:25] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:20:25] [INFO ] Applying decomposition
[2024-05-28 21:20:25] [INFO ] Flatten gal took : 10 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/graph7393828987447798067.txt' '-o' '/tmp/graph7393828987447798067.bin' '-w' '/tmp/graph7393828987447798067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7393828987447798067.bin' '-l' '-1' '-v' '-w' '/tmp/graph7393828987447798067.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:20:25] [INFO ] Decomposing Gal with order
[2024-05-28 21:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:20:25] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-28 21:20:25] [INFO ] Flatten gal took : 33 ms
[2024-05-28 21:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability173084211978142020.gal : 4 ms
[2024-05-28 21:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16086689479996305494.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/CTLFireability173084211978142020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16086689479996305494.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 596 transition count 546
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 596 transition count 546
Applied a total of 78 rules in 25 ms. Remains 596 /635 variables (removed 39) and now considering 546/585 (removed 39) transitions.
// Phase 1: matrix 546 rows 596 cols
[2024-05-28 21:20:55] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 21:20:55] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-28 21:20:55] [INFO ] Invariant cache hit.
[2024-05-28 21:20:56] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 545 sub problems to find dead transitions.
[2024-05-28 21:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:21:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:21:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:08] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:21:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:21:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:21:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:21:19] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-28 21:21:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:19] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:21:21] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:21:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:21:22] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-28 21:21:22] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:21:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:21:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:21:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:21:24] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1142 variables, and 171 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:21:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:21:34] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:21:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:21:34] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:21:35] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 16/187 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:21:40] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:21:40] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 6 (OVERLAPS) 546/1142 variables, 596/786 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 545/1331 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-28 21:21:50] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:21:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:21:50] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:21:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:21:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 4 ms to minimize.
[2024-05-28 21:21:51] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:21:52] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 4 ms to minimize.
[2024-05-28 21:21:52] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 4 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:21:53] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:21:54] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 4 ms to minimize.
[2024-05-28 21:21:54] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 4 ms to minimize.
[2024-05-28 21:21:54] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
[2024-05-28 21:21:55] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-28 21:21:55] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-05-28 21:21:56] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1142 variables, 20/1351 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1351 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 119/119 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 596/635 places, 546/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 596/635 places, 546/585 transitions.
[2024-05-28 21:21:56] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:21:56] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:21:56] [INFO ] Input system was already deterministic with 546 transitions.
[2024-05-28 21:21:56] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:21:56] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:21:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13404467361899526356.gal : 2 ms
[2024-05-28 21:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11628776995768390179.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/CTLFireability13404467361899526356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11628776995768390179.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-28 21:22:26] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:22:26] [INFO ] Applying decomposition
[2024-05-28 21:22:26] [INFO ] Flatten gal took : 10 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/graph9146539264378389152.txt' '-o' '/tmp/graph9146539264378389152.bin' '-w' '/tmp/graph9146539264378389152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9146539264378389152.bin' '-l' '-1' '-v' '-w' '/tmp/graph9146539264378389152.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:22:26] [INFO ] Decomposing Gal with order
[2024-05-28 21:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:22:26] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 21:22:26] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 21:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1958842623366403896.gal : 5 ms
[2024-05-28 21:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15930152758497779318.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/CTLFireability1958842623366403896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15930152758497779318.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 634 transition count 451
Reduce places removed 133 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 267 place count 501 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 500 transition count 450
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 268 place count 500 transition count 390
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 388 place count 440 transition count 390
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 418 place count 410 transition count 360
Iterating global reduction 3 with 30 rules applied. Total rules applied 448 place count 410 transition count 360
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 448 place count 410 transition count 341
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 486 place count 391 transition count 341
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 792 place count 238 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 793 place count 238 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 795 place count 237 transition count 186
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 797 place count 235 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 799 place count 233 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 799 place count 233 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 801 place count 232 transition count 183
Applied a total of 801 rules in 62 ms. Remains 232 /635 variables (removed 403) and now considering 183/585 (removed 402) transitions.
// Phase 1: matrix 183 rows 232 cols
[2024-05-28 21:22:56] [INFO ] Computed 89 invariants in 2 ms
[2024-05-28 21:22:56] [INFO ] Implicit Places using invariants in 185 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 231/635 places, 183/585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 182
Applied a total of 2 rules in 6 ms. Remains 230 /231 variables (removed 1) and now considering 182/183 (removed 1) transitions.
// Phase 1: matrix 182 rows 230 cols
[2024-05-28 21:22:56] [INFO ] Computed 88 invariants in 1 ms
[2024-05-28 21:22:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 21:22:57] [INFO ] Invariant cache hit.
[2024-05-28 21:22:57] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 230/635 places, 182/585 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 543 ms. Remains : 230/635 places, 182/585 transitions.
[2024-05-28 21:22:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:22:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:22:57] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-28 21:22:57] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:22:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:22:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4162029801520697357.gal : 1 ms
[2024-05-28 21:22:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4139955542005790331.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/CTLFireability4162029801520697357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4139955542005790331.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1298e+34,0.32638,15368,2,803,5,51253,6,0,1104,74626,0


Converting to forward existential form...Done !
original formula: (AG((p128==1)) + AG(A(AF(AG((((p516==1)&&(p529==1))&&(p563==1)))) U ((p93==1)&&(p121==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU((Init * !(!(E(TRUE U !((p128==1)))))),TRUE),!(((p93==1)&&(p121==1)))) * !(((p93==1)&&(p121==1)...316
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t39, t41, t43, t45, t46, t48, t51, t107, t111, t146, Intersection with reachable at...224
Hit Full ! (commute/partial/dont) 178/0/4
(forward)formula 0,0,1.39247,47584,1,0,355,267099,398,159,7285,214255,385
FORMULA ShieldIIPt-PT-010B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 595 transition count 545
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 595 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 594 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Applied a total of 84 rules in 30 ms. Remains 593 /635 variables (removed 42) and now considering 543/585 (removed 42) transitions.
// Phase 1: matrix 543 rows 593 cols
[2024-05-28 21:22:58] [INFO ] Computed 91 invariants in 2 ms
[2024-05-28 21:22:58] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 21:22:58] [INFO ] Invariant cache hit.
[2024-05-28 21:22:59] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-05-28 21:22:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 3 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:23:08] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:23:09] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-28 21:23:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:23:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:23:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:23:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:23:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:23:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:23:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:11] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:23:11] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:23:12] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:23:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2024-05-28 21:23:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-28 21:23:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-28 21:23:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 21:23:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 21:23:24] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:23:25] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 21:23:26] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:23:27] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1136 variables, and 172 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:23:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:23:36] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:23:37] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:23:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:23:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:23:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:23:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (OVERLAPS) 543/1136 variables, 593/777 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1136 variables, 542/1319 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:23:52] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:23:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:23:53] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:23:54] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:23:55] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:23:56] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-05-28 21:23:57] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-05-28 21:23:57] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 4 ms to minimize.
[2024-05-28 21:23:58] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 4 ms to minimize.
[2024-05-28 21:23:58] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 4 ms to minimize.
[2024-05-28 21:23:59] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2024-05-28 21:23:59] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/1136 variables, and 1336 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 110/110 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 593/635 places, 543/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60671 ms. Remains : 593/635 places, 543/585 transitions.
[2024-05-28 21:23:59] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:23:59] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:23:59] [INFO ] Input system was already deterministic with 543 transitions.
[2024-05-28 21:23:59] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:23:59] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:23:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2525777920507246088.gal : 2 ms
[2024-05-28 21:23:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17831794655357400570.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/CTLFireability2525777920507246088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17831794655357400570.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-28 21:24:29] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:24:29] [INFO ] Applying decomposition
[2024-05-28 21:24:29] [INFO ] Flatten gal took : 9 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/graph11762767205080366028.txt' '-o' '/tmp/graph11762767205080366028.bin' '-w' '/tmp/graph11762767205080366028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11762767205080366028.bin' '-l' '-1' '-v' '-w' '/tmp/graph11762767205080366028.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:24:29] [INFO ] Decomposing Gal with order
[2024-05-28 21:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:24:29] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-28 21:24:29] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:24:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15213830777014601298.gal : 15 ms
[2024-05-28 21:24:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8809357697815408322.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/CTLFireability15213830777014601298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8809357697815408322.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 595 transition count 545
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 595 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 594 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Applied a total of 84 rules in 41 ms. Remains 593 /635 variables (removed 42) and now considering 543/585 (removed 42) transitions.
// Phase 1: matrix 543 rows 593 cols
[2024-05-28 21:24:59] [INFO ] Computed 91 invariants in 13 ms
[2024-05-28 21:24:59] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-28 21:24:59] [INFO ] Invariant cache hit.
[2024-05-28 21:25:00] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-05-28 21:25:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:25:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:25:10] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:25:12] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:25:13] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:25:20] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:25:21] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 6 ms to minimize.
[2024-05-28 21:25:22] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:25:22] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:25:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:25:24] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:25:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:25:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:25:26] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:29] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:25:30] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:25:30] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:25:30] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:25:30] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/1136 variables, and 176 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/593 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:25:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:25:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:37] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:25:38] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:25:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:25:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:25:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/593 variables, 16/192 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:25:44] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:25:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 7 (OVERLAPS) 543/1136 variables, 593/789 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1136 variables, 542/1331 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-28 21:25:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:25:59] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:25:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:26:00] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
SMT process timed out in 60074ms, After SMT, problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 593/635 places, 543/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60654 ms. Remains : 593/635 places, 543/585 transitions.
[2024-05-28 21:26:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:26:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:26:00] [INFO ] Input system was already deterministic with 543 transitions.
[2024-05-28 21:26:00] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:26:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:26:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4830706994531294940.gal : 2 ms
[2024-05-28 21:26:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15846813254143500465.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/CTLFireability4830706994531294940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15846813254143500465.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-28 21:26:30] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:26:30] [INFO ] Applying decomposition
[2024-05-28 21:26:30] [INFO ] Flatten gal took : 9 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/graph12067000125327326230.txt' '-o' '/tmp/graph12067000125327326230.bin' '-w' '/tmp/graph12067000125327326230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12067000125327326230.bin' '-l' '-1' '-v' '-w' '/tmp/graph12067000125327326230.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:26:30] [INFO ] Decomposing Gal with order
[2024-05-28 21:26:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:26:30] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-28 21:26:30] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:26:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:26:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17461462205755412974.gal : 4 ms
[2024-05-28 21:26:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15197674115138912583.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/CTLFireability17461462205755412974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15197674115138912583.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 634 transition count 445
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 495 transition count 445
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 278 place count 495 transition count 387
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 394 place count 437 transition count 387
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 422 place count 409 transition count 359
Iterating global reduction 2 with 28 rules applied. Total rules applied 450 place count 409 transition count 359
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 450 place count 409 transition count 340
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 488 place count 390 transition count 340
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 800 place count 234 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 801 place count 234 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 233 transition count 182
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 805 place count 231 transition count 180
Applied a total of 805 rules in 64 ms. Remains 231 /635 variables (removed 404) and now considering 180/585 (removed 405) transitions.
// Phase 1: matrix 180 rows 231 cols
[2024-05-28 21:27:00] [INFO ] Computed 91 invariants in 0 ms
[2024-05-28 21:27:00] [INFO ] Implicit Places using invariants in 121 ms returned [221]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 230/635 places, 180/585 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 230 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 179
Applied a total of 2 rules in 5 ms. Remains 229 /230 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 229 cols
[2024-05-28 21:27:00] [INFO ] Computed 90 invariants in 1 ms
[2024-05-28 21:27:00] [INFO ] Implicit Places using invariants in 102 ms returned [214]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 228/635 places, 179/585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 178
Applied a total of 2 rules in 6 ms. Remains 227 /228 variables (removed 1) and now considering 178/179 (removed 1) transitions.
// Phase 1: matrix 178 rows 227 cols
[2024-05-28 21:27:00] [INFO ] Computed 89 invariants in 0 ms
[2024-05-28 21:27:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 21:27:01] [INFO ] Invariant cache hit.
[2024-05-28 21:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:27:01] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 227/635 places, 178/585 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 603 ms. Remains : 227/635 places, 178/585 transitions.
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:27:01] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1864790215343735869.gal : 1 ms
[2024-05-28 21:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12330809105989110237.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/CTLFireability1864790215343735869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12330809105989110237.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69976e+34,0.184383,10592,2,970,5,30384,6,0,1086,40228,0


Converting to forward existential form...Done !
original formula: EG(AF((p638==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p638==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t37, t39, t41, t43, t45, t48, t50, t52, t54, t56, t59, t6...409
(forward)formula 0,1,0.854243,33732,1,0,415,188716,381,185,6846,113088,373
FORMULA ShieldIIPt-PT-010B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 594 transition count 544
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 592 transition count 542
Applied a total of 86 rules in 29 ms. Remains 592 /635 variables (removed 43) and now considering 542/585 (removed 43) transitions.
// Phase 1: matrix 542 rows 592 cols
[2024-05-28 21:27:02] [INFO ] Computed 91 invariants in 5 ms
[2024-05-28 21:27:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 21:27:02] [INFO ] Invariant cache hit.
[2024-05-28 21:27:02] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-28 21:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:27:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:27:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:27:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:27:14] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:27:21] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 21:27:24] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:27:26] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:27:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:27:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:27:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:27:29] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 30084ms
Starting structural reductions in LTL mode, iteration 1 : 592/635 places, 542/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30658 ms. Remains : 592/635 places, 542/585 transitions.
[2024-05-28 21:27:32] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:27:32] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:27:32] [INFO ] Input system was already deterministic with 542 transitions.
[2024-05-28 21:27:32] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:27:32] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:27:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9818026458077612156.gal : 2 ms
[2024-05-28 21:27:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7696299683865587929.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/CTLFireability9818026458077612156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7696299683865587929.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-28 21:28:03] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:28:03] [INFO ] Applying decomposition
[2024-05-28 21:28:03] [INFO ] Flatten gal took : 10 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/graph8927847891154082724.txt' '-o' '/tmp/graph8927847891154082724.bin' '-w' '/tmp/graph8927847891154082724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8927847891154082724.bin' '-l' '-1' '-v' '-w' '/tmp/graph8927847891154082724.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:28:03] [INFO ] Decomposing Gal with order
[2024-05-28 21:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:28:03] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-28 21:28:03] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 21:28:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1618430466229091467.gal : 5 ms
[2024-05-28 21:28:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10242004002758553225.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/CTLFireability1618430466229091467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10242004002758553225.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 596 transition count 546
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 596 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 595 transition count 545
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 595 transition count 545
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 594 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 594 transition count 544
Applied a total of 82 rules in 36 ms. Remains 594 /635 variables (removed 41) and now considering 544/585 (removed 41) transitions.
// Phase 1: matrix 544 rows 594 cols
[2024-05-28 21:28:33] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 21:28:33] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 21:28:33] [INFO ] Invariant cache hit.
[2024-05-28 21:28:33] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2024-05-28 21:28:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 4 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:28:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:28:45] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:28:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:28:46] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-28 21:28:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:28:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:28:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 3 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:28:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:28:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:28:58] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:28:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:29:00] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:29:01] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:29:01] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 21:29:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:29:03] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1138 variables, and 172 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/594 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/594 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 81/172 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:29:09] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:29:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:29:11] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:29:12] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:29:13] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 12/184 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:29:15] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:29:18] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/594 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (OVERLAPS) 544/1138 variables, 594/781 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1138 variables, 543/1324 constraints. Problems are: Problem set: 0 solved, 543 unsolved
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:29:27] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:29:28] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 4 ms to minimize.
[2024-05-28 21:29:29] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:29:29] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-28 21:29:29] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:29:30] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-28 21:29:30] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 4 ms to minimize.
[2024-05-28 21:29:31] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 4 ms to minimize.
[2024-05-28 21:29:32] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:29:33] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 1342 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 114/114 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 594/635 places, 544/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 594/635 places, 544/585 transitions.
[2024-05-28 21:29:33] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:29:33] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:29:33] [INFO ] Input system was already deterministic with 544 transitions.
[2024-05-28 21:29:33] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:29:33] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10387471512543247554.gal : 2 ms
[2024-05-28 21:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14879925105630452755.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/CTLFireability10387471512543247554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14879925105630452755.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-28 21:30:04] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:30:04] [INFO ] Applying decomposition
[2024-05-28 21:30:04] [INFO ] Flatten gal took : 10 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/graph14211488366873699324.txt' '-o' '/tmp/graph14211488366873699324.bin' '-w' '/tmp/graph14211488366873699324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14211488366873699324.bin' '-l' '-1' '-v' '-w' '/tmp/graph14211488366873699324.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:30:04] [INFO ] Decomposing Gal with order
[2024-05-28 21:30:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:30:04] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 21:30:04] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:30:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability714843901900661042.gal : 7 ms
[2024-05-28 21:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1016579791937152160.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/CTLFireability714843901900661042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1016579791937152160.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 597 transition count 547
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 597 transition count 547
Applied a total of 76 rules in 15 ms. Remains 597 /635 variables (removed 38) and now considering 547/585 (removed 38) transitions.
// Phase 1: matrix 547 rows 597 cols
[2024-05-28 21:30:34] [INFO ] Computed 91 invariants in 3 ms
[2024-05-28 21:30:34] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-28 21:30:34] [INFO ] Invariant cache hit.
[2024-05-28 21:30:34] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2024-05-28 21:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:30:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:30:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 4 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 21:30:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:30:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:30:47] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:30:48] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:30:49] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2024-05-28 21:30:49] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:30:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:30:55] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:30:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:30:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:30:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-28 21:30:57] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:31:00] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:31:00] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:31:00] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:31:00] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:31:01] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:31:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1144 variables, and 171 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:31:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:31:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:31:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:31:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:31:12] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:31:12] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:31:12] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:31:12] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:31:13] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:31:13] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:31:13] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:31:14] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:31:19] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:31:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (OVERLAPS) 547/1144 variables, 597/782 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 546/1328 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-28 21:31:29] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:31:30] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 4 ms to minimize.
[2024-05-28 21:31:30] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:31:30] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 21:31:31] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 4 ms to minimize.
[2024-05-28 21:31:31] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 4 ms to minimize.
[2024-05-28 21:31:32] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:31:33] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-28 21:31:33] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-28 21:31:33] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 4 ms to minimize.
[2024-05-28 21:31:34] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1339 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 105/105 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 597/635 places, 547/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 597/635 places, 547/585 transitions.
[2024-05-28 21:31:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:31:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:31:34] [INFO ] Input system was already deterministic with 547 transitions.
[2024-05-28 21:31:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:31:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11137647778448006165.gal : 2 ms
[2024-05-28 21:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5482523045335989981.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/CTLFireability11137647778448006165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5482523045335989981.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-28 21:32:05] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:32:05] [INFO ] Applying decomposition
[2024-05-28 21:32:05] [INFO ] Flatten gal took : 10 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/graph12375929107709459507.txt' '-o' '/tmp/graph12375929107709459507.bin' '-w' '/tmp/graph12375929107709459507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12375929107709459507.bin' '-l' '-1' '-v' '-w' '/tmp/graph12375929107709459507.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:32:05] [INFO ] Decomposing Gal with order
[2024-05-28 21:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:32:05] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-28 21:32:05] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:32:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:32:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8981346901058813469.gal : 3 ms
[2024-05-28 21:32:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7397528049533005271.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/CTLFireability8981346901058813469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7397528049533005271.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 634 transition count 449
Reduce places removed 135 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 136 rules applied. Total rules applied 271 place count 499 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 272 place count 498 transition count 448
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 272 place count 498 transition count 390
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 388 place count 440 transition count 390
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 416 place count 412 transition count 362
Iterating global reduction 3 with 28 rules applied. Total rules applied 444 place count 412 transition count 362
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 444 place count 412 transition count 343
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 482 place count 393 transition count 343
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 798 place count 235 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 235 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 801 place count 234 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 803 place count 232 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 805 place count 230 transition count 181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 805 place count 230 transition count 180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 807 place count 229 transition count 180
Applied a total of 807 rules in 41 ms. Remains 229 /635 variables (removed 406) and now considering 180/585 (removed 405) transitions.
// Phase 1: matrix 180 rows 229 cols
[2024-05-28 21:32:35] [INFO ] Computed 89 invariants in 2 ms
[2024-05-28 21:32:35] [INFO ] Implicit Places using invariants in 111 ms returned [214]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 228/635 places, 180/585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 179
Applied a total of 2 rules in 6 ms. Remains 227 /228 variables (removed 1) and now considering 179/180 (removed 1) transitions.
// Phase 1: matrix 179 rows 227 cols
[2024-05-28 21:32:35] [INFO ] Computed 88 invariants in 1 ms
[2024-05-28 21:32:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 21:32:35] [INFO ] Invariant cache hit.
[2024-05-28 21:32:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 227/635 places, 179/585 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 422 ms. Remains : 227/635 places, 179/585 transitions.
[2024-05-28 21:32:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:32:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:32:35] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-28 21:32:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:32:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:32:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2511697095943453537.gal : 1 ms
[2024-05-28 21:32:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6032702853449942691.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/CTLFireability2511697095943453537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6032702853449942691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.02907e+34,0.179349,10600,2,738,5,31276,6,0,1090,41148,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((p686==1) + !(A((p522==1) U (p387==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p686==1) + !(!((E(!((p387==1)) U (!((p522==1)) * !((p387==1)))) + EG(!((p387=...179
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 177/0/2
Hit Full ! (commute/partial/dont) 177/0/2
Detected timeout of ITS tools.
[2024-05-28 21:33:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:33:05] [INFO ] Applying decomposition
[2024-05-28 21:33:05] [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/graph6613381818516900056.txt' '-o' '/tmp/graph6613381818516900056.bin' '-w' '/tmp/graph6613381818516900056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6613381818516900056.bin' '-l' '-1' '-v' '-w' '/tmp/graph6613381818516900056.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:33:05] [INFO ] Decomposing Gal with order
[2024-05-28 21:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:33:05] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-28 21:33:05] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:33:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 21:33:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1850751763068846137.gal : 2 ms
[2024-05-28 21:33:05] [INFO ] Time to serialize properties into /tmp/CTLFireability330788430341830093.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/CTLFireability1850751763068846137.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability330788430341830093.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.02907e+34,0.114139,8552,54,15,10266,117,366,20417,50,652,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((i11.i2.u78.p686==1) + !(A((i10.u62.p522==1) U (i5.u46.p387==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i11.i2.u78.p686==1) + !(!((E(!((i5.u46.p387==1)) U (!((i10.u62.p522==1)) * !(...219
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 606 transition count 556
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 606 transition count 556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 605 transition count 555
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 605 transition count 555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 604 transition count 554
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 604 transition count 554
Applied a total of 62 rules in 49 ms. Remains 604 /635 variables (removed 31) and now considering 554/585 (removed 31) transitions.
// Phase 1: matrix 554 rows 604 cols
[2024-05-28 21:33:35] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 21:33:36] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-28 21:33:36] [INFO ] Invariant cache hit.
[2024-05-28 21:33:36] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 553 sub problems to find dead transitions.
[2024-05-28 21:33:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:33:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:33:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:33:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:33:47] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:33:47] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:33:47] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:33:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:33:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:33:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:33:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-28 21:33:49] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:33:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:33:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:33:56] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:33:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:33:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:33:59] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:33:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:33:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:33:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:34:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:34:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 21:34:03] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 553 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/1158 variables, and 171 constraints, problems are : Problem set: 0 solved, 553 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/604 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 553 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (OVERLAPS) 1/604 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:34:13] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:34:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:34:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:34:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:34:16] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/604 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:34:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:34:22] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 7 (OVERLAPS) 554/1158 variables, 604/797 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1158 variables, 553/1350 constraints. Problems are: Problem set: 0 solved, 553 unsolved
[2024-05-28 21:34:35] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 21:34:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:34:35] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:34:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:34:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:34:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1356 constraints, problems are : Problem set: 0 solved, 553 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 604/604 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 108/108 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 553 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 604/635 places, 554/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 604/635 places, 554/585 transitions.
[2024-05-28 21:34:36] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:34:36] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:34:36] [INFO ] Input system was already deterministic with 554 transitions.
[2024-05-28 21:34:36] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:34:36] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:34:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9577121711327382015.gal : 2 ms
[2024-05-28 21:34:36] [INFO ] Time to serialize properties into /tmp/CTLFireability670761537655703076.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/CTLFireability9577121711327382015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability670761537655703076.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.
Detected timeout of ITS tools.
[2024-05-28 21:35:06] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:35:06] [INFO ] Applying decomposition
[2024-05-28 21:35:06] [INFO ] Flatten gal took : 10 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/graph16644679420757677570.txt' '-o' '/tmp/graph16644679420757677570.bin' '-w' '/tmp/graph16644679420757677570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16644679420757677570.bin' '-l' '-1' '-v' '-w' '/tmp/graph16644679420757677570.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:35:06] [INFO ] Decomposing Gal with order
[2024-05-28 21:35:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:35:06] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-28 21:35:06] [INFO ] Flatten gal took : 17 ms
[2024-05-28 21:35:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11503260186719787498.gal : 4 ms
[2024-05-28 21:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1746792366362880570.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/CTLFireability11503260186719787498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1746792366362880570.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 635/635 places, 585/585 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 594 transition count 544
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 594 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 593 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 593 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 592 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 592 transition count 542
Applied a total of 86 rules in 36 ms. Remains 592 /635 variables (removed 43) and now considering 542/585 (removed 43) transitions.
// Phase 1: matrix 542 rows 592 cols
[2024-05-28 21:35:36] [INFO ] Computed 91 invariants in 4 ms
[2024-05-28 21:35:37] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 21:35:37] [INFO ] Invariant cache hit.
[2024-05-28 21:35:37] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-28 21:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:35:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 4 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 21:35:47] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:35:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:35:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:35:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:35:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:35:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:35:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:35:57] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:35:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:35:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:35:57] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:35:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:01] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:36:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:36:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 21:36:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:36:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1134 variables, and 174 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 83/174 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:36:14] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:36:15] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 21:36:15] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-28 21:36:15] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 21:36:15] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-28 21:36:16] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 13/187 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:21] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:24] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 21:36:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 7 (OVERLAPS) 542/1134 variables, 592/782 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 541/1323 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2024-05-28 21:36:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 1324 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 100/100 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 592/635 places, 542/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60676 ms. Remains : 592/635 places, 542/585 transitions.
[2024-05-28 21:36:37] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:36:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:36:37] [INFO ] Input system was already deterministic with 542 transitions.
[2024-05-28 21:36:37] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:36:37] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2435838613361509188.gal : 7 ms
[2024-05-28 21:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10191703913528978151.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/CTLFireability2435838613361509188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10191703913528978151.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-28 21:37:07] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:37:07] [INFO ] Applying decomposition
[2024-05-28 21:37:07] [INFO ] Flatten gal took : 10 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/graph223027133266737808.txt' '-o' '/tmp/graph223027133266737808.bin' '-w' '/tmp/graph223027133266737808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph223027133266737808.bin' '-l' '-1' '-v' '-w' '/tmp/graph223027133266737808.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:07] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:07] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-28 21:37:07] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 21:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2672121770176699829.gal : 3 ms
[2024-05-28 21:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability12926685660148800234.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/CTLFireability2672121770176699829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12926685660148800234.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.
Detected timeout of ITS tools.
[2024-05-28 21:37:37] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:37:37] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:37:37] [INFO ] Applying decomposition
[2024-05-28 21:37:37] [INFO ] Flatten gal took : 20 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/graph15292709323507908229.txt' '-o' '/tmp/graph15292709323507908229.bin' '-w' '/tmp/graph15292709323507908229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15292709323507908229.bin' '-l' '-1' '-v' '-w' '/tmp/graph15292709323507908229.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:38] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:38] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-28 21:37:38] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:37:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability924958559146666818.gal : 4 ms
[2024-05-28 21:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4658163212818698356.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/CTLFireability924958559146666818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4658163212818698356.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:44:56] [INFO ] Applying decomposition
[2024-05-28 21:44:56] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:44:56] [INFO ] Decomposing Gal with order
[2024-05-28 21:44:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:44:56] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-28 21:44:56] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:44:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15420736005565570027.gal : 5 ms
[2024-05-28 21:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability6567237278497172520.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/CTLFireability15420736005565570027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6567237278497172520.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 21:52:45] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:52:45] [INFO ] Input system was already deterministic with 585 transitions.
[2024-05-28 21:52:45] [INFO ] Transformed 635 places.
[2024-05-28 21:52:45] [INFO ] Transformed 585 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-28 21:52:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1473872035298988792.gal : 3 ms
[2024-05-28 21:52:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1310349137565614627.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/CTLFireability1473872035298988792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1310349137565614627.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3155371 ms.

BK_STOP 1716933774899

--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-171683760700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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