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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 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 332K 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 ShieldIIPs-PT-020B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716898250123

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 12:10:51] [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 12:10:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:10:51] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-28 12:10:51] [INFO ] Transformed 1203 places.
[2024-05-28 12:10:51] [INFO ] Transformed 1183 transitions.
[2024-05-28 12:10:51] [INFO ] Found NUPN structural information;
[2024-05-28 12:10:51] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 167 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 112 place count 1091 transition count 1071
Iterating global reduction 0 with 112 rules applied. Total rules applied 224 place count 1091 transition count 1071
Applied a total of 224 rules in 173 ms. Remains 1091 /1203 variables (removed 112) and now considering 1071/1183 (removed 112) transitions.
// Phase 1: matrix 1071 rows 1091 cols
[2024-05-28 12:10:51] [INFO ] Computed 181 invariants in 30 ms
[2024-05-28 12:10:52] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 12:10:52] [INFO ] Invariant cache hit.
[2024-05-28 12:10:53] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
Running 1070 sub problems to find dead transitions.
[2024-05-28 12:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1090 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
SMT process timed out in 30388ms, After SMT, problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 30461ms
Starting structural reductions in LTL mode, iteration 1 : 1091/1203 places, 1071/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32010 ms. Remains : 1091/1203 places, 1071/1183 transitions.
Support contains 167 out of 1091 places after structural reductions.
[2024-05-28 12:11:23] [INFO ] Flatten gal took : 113 ms
[2024-05-28 12:11:23] [INFO ] Flatten gal took : 57 ms
[2024-05-28 12:11:24] [INFO ] Input system was already deterministic with 1071 transitions.
Support contains 165 out of 1091 places (down from 167) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 1880 ms. (21 steps per ms) remains 10/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
[2024-05-28 12:11:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 447/481 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 610/1091 variables, 114/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1071/2162 variables, 1091/1272 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 12:11:26] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 35 ms to minimize.
[2024-05-28 12:11:26] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 4 ms to minimize.
[2024-05-28 12:11:26] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 4 ms to minimize.
[2024-05-28 12:11:26] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 4 ms to minimize.
[2024-05-28 12:11:27] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 4 ms to minimize.
[2024-05-28 12:11:27] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 7 ms to minimize.
[2024-05-28 12:11:27] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2024-05-28 12:11:27] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-05-28 12:11:27] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-05-28 12:11:28] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-28 12:11:28] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-28 12:11:28] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-28 12:11:28] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 4 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-28 12:11:28] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 4 ms to minimize.
[2024-05-28 12:11:29] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 3 ms to minimize.
[2024-05-28 12:11:29] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 4 ms to minimize.
[2024-05-28 12:11:29] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 3 ms to minimize.
[2024-05-28 12:11:29] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 4 ms to minimize.
[2024-05-28 12:11:29] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 4 ms to minimize.
[2024-05-28 12:11:30] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
Problem AtomicPropp0 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/2162 variables, 20/1292 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2162/2162 variables, and 1292 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1091/1091 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 436/468 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 2/66 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 12:11:30] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2024-05-28 12:11:30] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 7/73 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 623/1091 variables, 117/190 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 18/208 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 3 ms to minimize.
[2024-05-28 12:11:31] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 3 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 6 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:11:32] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 3 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:11:33] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1091 variables, 20/228 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:11:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1091 variables, 8/236 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 12:11:35] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1091 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/2162 variables, and 237 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1091 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 56/56 constraints]
After SMT, in 10057ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 1091 transition count 977
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 997 transition count 976
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 996 transition count 976
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 190 place count 996 transition count 876
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 390 place count 896 transition count 876
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 413 place count 873 transition count 853
Iterating global reduction 3 with 23 rules applied. Total rules applied 436 place count 873 transition count 853
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 436 place count 873 transition count 843
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 456 place count 863 transition count 843
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 3 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1124 place count 529 transition count 509
Partial Free-agglomeration rule applied 128 times.
Drop transitions (Partial Free agglomeration) removed 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 1252 place count 529 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1253 place count 528 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1254 place count 527 transition count 508
Applied a total of 1254 rules in 264 ms. Remains 527 /1091 variables (removed 564) and now considering 508/1071 (removed 563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 527/1091 places, 508/1071 transitions.
RANDOM walk for 40000 steps (19 resets) in 786 ms. (50 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/5 properties
// Phase 1: matrix 508 rows 527 cols
[2024-05-28 12:11:36] [INFO ] Computed 180 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/164 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 278/442 variables, 99/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/448 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 454/902 variables, 448/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 77/979 variables, 40/639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 13/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/980 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/982 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 2/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/982 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 44/1026 variables, 28/685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1026 variables, 8/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1026 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/1028 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1028 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1028 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/1030 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1030 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1030 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 5/1035 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1035 variables, 2/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1035 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1035 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 707 constraints, problems are : Problem set: 0 solved, 4 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/164 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:36] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:11:36] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 278/442 variables, 99/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/448 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 454/902 variables, 448/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-28 12:11:37] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/902 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/902 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 77/979 variables, 40/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/979 variables, 13/673 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/979 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:38] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/979 variables, 9/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/979 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/979 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/979 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/979 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1/980 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/980 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/980 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/982 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/982 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:40] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/982 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/982 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/982 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/982 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:41] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/982 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/982 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 44/1026 variables, 28/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1026 variables, 8/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:42] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1026 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1026 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 2/1028 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1028 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:42] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1028 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:42] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:11:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1028 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1028 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/1030 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1030 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1030 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 5/1035 variables, 4/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1035 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1035 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/1035 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 753 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6317 ms.
Refiners :[Positive P Invariants (semi-flows): 177/177 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 527/527 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 42/42 constraints]
After SMT, in 7109ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4107 ms.
Support contains 16 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 508/508 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 527 transition count 503
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 522 transition count 503
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 514 transition count 495
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 31 place count 514 transition count 495
Applied a total of 31 rules in 70 ms. Remains 514 /527 variables (removed 13) and now considering 495/508 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 514/527 places, 495/508 transitions.
RANDOM walk for 40000 steps (15 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 156514 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 156514 steps, saw 108137 distinct states, run finished after 3005 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 495 rows 514 cols
[2024-05-28 12:11:50] [INFO ] Computed 180 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:11:50] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:11:50] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 278/436 variables, 102/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:11:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 442/878 variables, 436/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/878 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 75/953 variables, 39/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 13/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/954 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/954 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/954 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/956 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/956 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/956 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 44/1000 variables, 28/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1000 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1000 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/1002 variables, 3/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1002 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1002 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/1004 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1004 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1004 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 5/1009 variables, 4/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1009 variables, 2/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1009 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1009 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 706 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 278/436 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:11:52] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 442/878 variables, 436/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/878 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/878 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/878 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:53] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/878 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/878 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 75/953 variables, 39/658 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/953 variables, 13/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/953 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/953 variables, 7/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:54] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/953 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:11:55] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:11:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/953 variables, 7/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/953 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1/954 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/954 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/954 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/956 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/956 variables, 2/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/956 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 44/1000 variables, 28/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1000 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1000 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 2/1002 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1002 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1002 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 2/1004 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1004 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1004 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 5/1009 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1009 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 12:11:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:11:57] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:11:57] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1009 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1009 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/1009 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 748 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5330 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 50/50 constraints]
After SMT, in 6877ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2795 ms.
Support contains 16 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 495/495 transitions.
Applied a total of 0 rules in 22 ms. Remains 514 /514 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 514/514 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 495/495 transitions.
Applied a total of 0 rules in 12 ms. Remains 514 /514 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2024-05-28 12:12:00] [INFO ] Invariant cache hit.
[2024-05-28 12:12:00] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-28 12:12:00] [INFO ] Invariant cache hit.
[2024-05-28 12:12:01] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-28 12:12:01] [INFO ] Redundant transitions in 25 ms returned []
Running 491 sub problems to find dead transitions.
[2024-05-28 12:12:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:12:07] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 3/514 variables, 146/188 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:12:16] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
[2024-05-28 12:12:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:12:17] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:12:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:12:17] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:12:18] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:12:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:12:18] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:12:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:19] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:20] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:12:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:12:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:22] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-28 12:12:22] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:12:23] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:12:24] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:29] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/1009 variables, and 249 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/514 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (OVERLAPS) 3/514 variables, 146/192 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 57/249 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:35] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:12:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:12:35] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:12:36] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:12:36] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:12:36] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:12:36] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:12:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:12:38] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:38] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:12:39] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:40] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:12:41] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:12:42] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:12:42] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:12:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:12:42] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:12:44] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:12:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:46] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:12:47] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:12:47] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:12:49] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:12:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:12:49] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:12:50] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-05-28 12:12:55] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:12:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/1009 variables, and 278 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/514 constraints, PredecessorRefiner: 0/491 constraints, Known Traps: 98/98 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61047 ms. Remains : 514/514 places, 495/495 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-28 12:13:01] [INFO ] Flatten gal took : 44 ms
[2024-05-28 12:13:01] [INFO ] Flatten gal took : 45 ms
[2024-05-28 12:13:01] [INFO ] Input system was already deterministic with 1071 transitions.
Computed a total of 257 stabilizing places and 257 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 57 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
// Phase 1: matrix 1046 rows 1066 cols
[2024-05-28 12:13:01] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 12:13:02] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-28 12:13:02] [INFO ] Invariant cache hit.
[2024-05-28 12:13:02] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2024-05-28 12:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1065 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
SMT process timed out in 30197ms, After SMT, problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 1066/1091 places, 1046/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31526 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-05-28 12:13:33] [INFO ] Flatten gal took : 36 ms
[2024-05-28 12:13:33] [INFO ] Flatten gal took : 34 ms
[2024-05-28 12:13:33] [INFO ] Input system was already deterministic with 1046 transitions.
[2024-05-28 12:13:33] [INFO ] Flatten gal took : 33 ms
[2024-05-28 12:13:33] [INFO ] Flatten gal took : 30 ms
[2024-05-28 12:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1293908799119440529.gal : 21 ms
[2024-05-28 12:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2378259368012700159.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/CTLFireability1293908799119440529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2378259368012700159.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 12:14:03] [INFO ] Flatten gal took : 33 ms
[2024-05-28 12:14:03] [INFO ] Applying decomposition
[2024-05-28 12:14:03] [INFO ] Flatten gal took : 30 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/graph9561438138784604166.txt' '-o' '/tmp/graph9561438138784604166.bin' '-w' '/tmp/graph9561438138784604166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9561438138784604166.bin' '-l' '-1' '-v' '-w' '/tmp/graph9561438138784604166.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:14:03] [INFO ] Decomposing Gal with order
[2024-05-28 12:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:14:04] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:14:04] [INFO ] Flatten gal took : 94 ms
[2024-05-28 12:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-28 12:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12163346484162713664.gal : 126 ms
[2024-05-28 12:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability698355188033831766.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/CTLFireability12163346484162713664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability698355188033831766.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 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 75 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
// Phase 1: matrix 1046 rows 1066 cols
[2024-05-28 12:14:34] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 12:14:34] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-28 12:14:34] [INFO ] Invariant cache hit.
[2024-05-28 12:14:35] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2024-05-28 12:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1065 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
SMT process timed out in 30178ms, After SMT, problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Starting structural reductions in LTL mode, iteration 1 : 1066/1091 places, 1046/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31479 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-05-28 12:15:05] [INFO ] Flatten gal took : 29 ms
[2024-05-28 12:15:05] [INFO ] Flatten gal took : 26 ms
[2024-05-28 12:15:05] [INFO ] Input system was already deterministic with 1046 transitions.
[2024-05-28 12:15:05] [INFO ] Flatten gal took : 27 ms
[2024-05-28 12:15:05] [INFO ] Flatten gal took : 31 ms
[2024-05-28 12:15:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7258450024063127195.gal : 7 ms
[2024-05-28 12:15:05] [INFO ] Time to serialize properties into /tmp/CTLFireability18445361796372041598.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/CTLFireability7258450024063127195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18445361796372041598.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 12:15:36] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:15:36] [INFO ] Applying decomposition
[2024-05-28 12:15:36] [INFO ] Flatten gal took : 27 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/graph16664692695731330439.txt' '-o' '/tmp/graph16664692695731330439.bin' '-w' '/tmp/graph16664692695731330439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16664692695731330439.bin' '-l' '-1' '-v' '-w' '/tmp/graph16664692695731330439.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:15:36] [INFO ] Decomposing Gal with order
[2024-05-28 12:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:15:36] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:15:36] [INFO ] Flatten gal took : 55 ms
[2024-05-28 12:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 12:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11134768586278196823.gal : 14 ms
[2024-05-28 12:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability18014347840243838723.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/CTLFireability11134768586278196823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18014347840243838723.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 LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1066 transition count 1046
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1066 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1065 transition count 1045
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1065 transition count 1045
Applied a total of 52 rules in 70 ms. Remains 1065 /1091 variables (removed 26) and now considering 1045/1071 (removed 26) transitions.
// Phase 1: matrix 1045 rows 1065 cols
[2024-05-28 12:16:06] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:16:06] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-28 12:16:06] [INFO ] Invariant cache hit.
[2024-05-28 12:16:07] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 1044 sub problems to find dead transitions.
[2024-05-28 12:16:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1064 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/1065 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1044 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 1065/2110 variables, and 181 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1065 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1064 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/1065 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-28 12:16:53] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:16:53] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:16:53] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:16:54] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:16:54] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:16:54] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:16:54] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-28 12:16:55] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:16:55] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-28 12:16:56] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-05-28 12:16:56] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-28 12:16:56] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-05-28 12:16:57] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-28 12:16:57] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 4 ms to minimize.
[2024-05-28 12:16:58] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-05-28 12:16:58] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 4 ms to minimize.
[2024-05-28 12:16:59] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 5 ms to minimize.
[2024-05-28 12:17:00] [INFO ] Deduced a trap composed of 49 places in 219 ms of which 5 ms to minimize.
[2024-05-28 12:17:00] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 5 ms to minimize.
[2024-05-28 12:17:01] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1065 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-28 12:17:02] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-28 12:17:04] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 4 ms to minimize.
[2024-05-28 12:17:06] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 5 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 5 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 5 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:17:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in LTL mode, iteration 1 : 1065/1091 places, 1045/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61469 ms. Remains : 1065/1091 places, 1045/1071 transitions.
[2024-05-28 12:17:07] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:17:08] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:17:08] [INFO ] Input system was already deterministic with 1045 transitions.
[2024-05-28 12:17:08] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:17:08] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4348119644616824820.gal : 4 ms
[2024-05-28 12:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9348906130065685300.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/CTLFireability4348119644616824820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9348906130065685300.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 12:17:38] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:17:38] [INFO ] Applying decomposition
[2024-05-28 12:17:38] [INFO ] Flatten gal took : 23 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/graph1345867723655969749.txt' '-o' '/tmp/graph1345867723655969749.bin' '-w' '/tmp/graph1345867723655969749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1345867723655969749.bin' '-l' '-1' '-v' '-w' '/tmp/graph1345867723655969749.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:17:38] [INFO ] Decomposing Gal with order
[2024-05-28 12:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:17:38] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:17:38] [INFO ] Flatten gal took : 50 ms
[2024-05-28 12:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 12:17:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8083890994543614439.gal : 15 ms
[2024-05-28 12:17:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9324385640186633913.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/CTLFireability8083890994543614439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9324385640186633913.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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1090 transition count 974
Reduce places removed 96 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 97 rules applied. Total rules applied 193 place count 994 transition count 973
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 993 transition count 973
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 194 place count 993 transition count 871
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 398 place count 891 transition count 871
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 426 place count 863 transition count 843
Iterating global reduction 3 with 28 rules applied. Total rules applied 454 place count 863 transition count 843
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 454 place count 863 transition count 830
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 480 place count 850 transition count 830
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1164 place count 508 transition count 488
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1166 place count 506 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1167 place count 505 transition count 486
Applied a total of 1167 rules in 120 ms. Remains 505 /1091 variables (removed 586) and now considering 486/1071 (removed 585) transitions.
// Phase 1: matrix 486 rows 505 cols
[2024-05-28 12:18:08] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 12:18:08] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-28 12:18:08] [INFO ] Invariant cache hit.
[2024-05-28 12:18:09] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-28 12:18:09] [INFO ] Redundant transitions in 51 ms returned [485]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 480 sub problems to find dead transitions.
// Phase 1: matrix 485 rows 505 cols
[2024-05-28 12:18:09] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:18:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:18:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 12:18:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:18:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:18:16] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:18:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:18:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:18:16] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:18:17] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:18:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:18:19] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:18:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:18:24] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:18:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:18:26] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:18:26] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 480 unsolved
[2024-05-28 12:18:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:18:28] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:18:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30092ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30101ms
Starting structural reductions in SI_CTL mode, iteration 1 : 505/1091 places, 485/1071 transitions.
Applied a total of 0 rules in 22 ms. Remains 505 /505 variables (removed 0) and now considering 485/485 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 30943 ms. Remains : 505/1091 places, 485/1071 transitions.
[2024-05-28 12:18:39] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:18:39] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:18:39] [INFO ] Input system was already deterministic with 485 transitions.
[2024-05-28 12:18:39] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:18:39] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:18:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6243741342914224086.gal : 2 ms
[2024-05-28 12:18:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12636786173685331408.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/CTLFireability6243741342914224086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12636786173685331408.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 12:19:09] [INFO ] Flatten gal took : 18 ms
[2024-05-28 12:19:09] [INFO ] Applying decomposition
[2024-05-28 12:19:09] [INFO ] Flatten gal took : 14 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/graph13663497015510960160.txt' '-o' '/tmp/graph13663497015510960160.bin' '-w' '/tmp/graph13663497015510960160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13663497015510960160.bin' '-l' '-1' '-v' '-w' '/tmp/graph13663497015510960160.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:19:09] [INFO ] Decomposing Gal with order
[2024-05-28 12:19:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:19:09] [INFO ] Removed a total of 324 redundant transitions.
[2024-05-28 12:19:09] [INFO ] Flatten gal took : 28 ms
[2024-05-28 12:19:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 9 ms.
[2024-05-28 12:19:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1520984325187175899.gal : 4 ms
[2024-05-28 12:19:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2574660666690691118.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/CTLFireability1520984325187175899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2574660666690691118.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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 1090 transition count 975
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 995 transition count 975
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 190 place count 995 transition count 872
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 396 place count 892 transition count 872
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 422 place count 866 transition count 846
Iterating global reduction 2 with 26 rules applied. Total rules applied 448 place count 866 transition count 846
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 448 place count 866 transition count 835
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 470 place count 855 transition count 835
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1154 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1156 place count 511 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1157 place count 510 transition count 491
Applied a total of 1157 rules in 98 ms. Remains 510 /1091 variables (removed 581) and now considering 491/1071 (removed 580) transitions.
// Phase 1: matrix 491 rows 510 cols
[2024-05-28 12:19:39] [INFO ] Computed 180 invariants in 1 ms
[2024-05-28 12:19:40] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-28 12:19:40] [INFO ] Invariant cache hit.
[2024-05-28 12:19:40] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-28 12:19:40] [INFO ] Redundant transitions in 66 ms returned [490]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 482 sub problems to find dead transitions.
// Phase 1: matrix 490 rows 510 cols
[2024-05-28 12:19:40] [INFO ] Computed 180 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:19:44] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:19:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 12:19:46] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:19:47] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:19:48] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:19:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:19:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:19:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:19:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:19:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:19:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:19:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:19:51] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:19:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:19:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:19:52] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:19:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:19:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:19:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:19:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:19:57] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:19:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:20:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:20:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:20:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:20:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:20:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 timeout
0.0)
(s18 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/1000 variables, and 224 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 163/180 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (OVERLAPS) 7/510 variables, 17/241 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:20:14] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:20:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:20:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:20:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:20:16] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-28 12:20:18] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:20:18] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:20:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:20:20] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:20:20] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 12:20:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:20:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:20:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:20:21] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 7/268 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (OVERLAPS) 490/1000 variables, 510/778 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 482/1260 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 12:20:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:20:35] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:20:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:20:37] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:20:38] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:20:38] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-28 12:20:39] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:20:40] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1268 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 96/96 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in SI_CTL mode, iteration 1 : 510/1091 places, 490/1071 transitions.
Applied a total of 0 rules in 12 ms. Remains 510 /510 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 60909 ms. Remains : 510/1091 places, 490/1071 transitions.
[2024-05-28 12:20:40] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:20:40] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:20:40] [INFO ] Input system was already deterministic with 490 transitions.
[2024-05-28 12:20:40] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:20:40] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10948252984872695553.gal : 3 ms
[2024-05-28 12:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4362452890844403669.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/CTLFireability10948252984872695553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4362452890844403669.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 12:21:10] [INFO ] Flatten gal took : 17 ms
[2024-05-28 12:21:10] [INFO ] Applying decomposition
[2024-05-28 12:21:10] [INFO ] Flatten gal took : 14 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/graph11351517498968699378.txt' '-o' '/tmp/graph11351517498968699378.bin' '-w' '/tmp/graph11351517498968699378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11351517498968699378.bin' '-l' '-1' '-v' '-w' '/tmp/graph11351517498968699378.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:21:10] [INFO ] Decomposing Gal with order
[2024-05-28 12:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:21:10] [INFO ] Removed a total of 328 redundant transitions.
[2024-05-28 12:21:10] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 6 ms.
[2024-05-28 12:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12964958968409941166.gal : 4 ms
[2024-05-28 12:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8491530798652773439.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/CTLFireability12964958968409941166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8491530798652773439.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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1090 transition count 970
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 201 place count 990 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 989 transition count 969
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 202 place count 989 transition count 868
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 404 place count 888 transition count 868
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 432 place count 860 transition count 840
Iterating global reduction 3 with 28 rules applied. Total rules applied 460 place count 860 transition count 840
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 460 place count 860 transition count 827
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 486 place count 847 transition count 827
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 3 with 690 rules applied. Total rules applied 1176 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1178 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1179 place count 499 transition count 480
Applied a total of 1179 rules in 92 ms. Remains 499 /1091 variables (removed 592) and now considering 480/1071 (removed 591) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 12:21:41] [INFO ] Computed 180 invariants in 5 ms
[2024-05-28 12:21:41] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-28 12:21:41] [INFO ] Invariant cache hit.
[2024-05-28 12:21:41] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-05-28 12:21:41] [INFO ] Redundant transitions in 52 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 12:21:41] [INFO ] Computed 180 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:21:45] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:21:45] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 12:21:45] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:21:45] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:21:46] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:21:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:21:48] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:21:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:21:50] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 12:21:51] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-28 12:21:52] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2024-05-28 12:21:52] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:21:53] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:21:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:21:56] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:21:57] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:21:57] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:21:57] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:21:58] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:21:58] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:21:59] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:21:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:21:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:21:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:21:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:22:00] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:22:00] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:22:00] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-05-28 12:22:00] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 12:22:00] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 12:22:01] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:22:01] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:22:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:22:01] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:22:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:22:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:22:02] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-28 12:22:02] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:22:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:22:03] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:22:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:22:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/978 variables, and 269 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 89/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 479/978 variables, 499/768 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 478/1246 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1246 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 89/89 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 499/1091 places, 479/1071 transitions.
Applied a total of 0 rules in 10 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 60967 ms. Remains : 499/1091 places, 479/1071 transitions.
[2024-05-28 12:22:42] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:22:42] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:22:42] [INFO ] Input system was already deterministic with 479 transitions.
[2024-05-28 12:22:42] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:22:42] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3117654783317482051.gal : 2 ms
[2024-05-28 12:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12490320238446784735.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/CTLFireability3117654783317482051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12490320238446784735.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 12:23:12] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:23:12] [INFO ] Applying decomposition
[2024-05-28 12:23:12] [INFO ] Flatten gal took : 14 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/graph17471715292208594301.txt' '-o' '/tmp/graph17471715292208594301.bin' '-w' '/tmp/graph17471715292208594301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17471715292208594301.bin' '-l' '-1' '-v' '-w' '/tmp/graph17471715292208594301.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:23:12] [INFO ] Decomposing Gal with order
[2024-05-28 12:23:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:23:12] [INFO ] Removed a total of 315 redundant transitions.
[2024-05-28 12:23:12] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:23:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 4 ms.
[2024-05-28 12:23:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13355193812227552264.gal : 3 ms
[2024-05-28 12:23:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15676845883084076088.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/CTLFireability13355193812227552264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15676845883084076088.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 LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 61 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 12:23:42] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 12:23:42] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-28 12:23:42] [INFO ] Invariant cache hit.
[2024-05-28 12:23:43] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 12:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:24:12] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:24:12] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:24:13] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 3 ms to minimize.
[2024-05-28 12:24:13] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:24:13] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30196ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1091 places, 1044/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31371 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-05-28 12:24:13] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:24:13] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:24:13] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-05-28 12:24:13] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:24:13] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:24:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4127089839337426297.gal : 4 ms
[2024-05-28 12:24:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6708685710247961807.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/CTLFireability4127089839337426297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6708685710247961807.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 12:24:44] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:24:44] [INFO ] Applying decomposition
[2024-05-28 12:24:44] [INFO ] Flatten gal took : 29 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/graph3172345845405988030.txt' '-o' '/tmp/graph3172345845405988030.bin' '-w' '/tmp/graph3172345845405988030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3172345845405988030.bin' '-l' '-1' '-v' '-w' '/tmp/graph3172345845405988030.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:24:44] [INFO ] Decomposing Gal with order
[2024-05-28 12:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:24:44] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:24:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 12:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:24:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10584501512847734472.gal : 8 ms
[2024-05-28 12:24:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17512355518798715591.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/CTLFireability10584501512847734472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17512355518798715591.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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1090 transition count 971
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 991 transition count 971
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 991 transition count 870
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 890 transition count 870
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 428 place count 862 transition count 842
Iterating global reduction 2 with 28 rules applied. Total rules applied 456 place count 862 transition count 842
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 456 place count 862 transition count 829
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 482 place count 849 transition count 829
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1172 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1174 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1175 place count 501 transition count 482
Applied a total of 1175 rules in 88 ms. Remains 501 /1091 variables (removed 590) and now considering 482/1071 (removed 589) transitions.
// Phase 1: matrix 482 rows 501 cols
[2024-05-28 12:25:14] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 12:25:14] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-28 12:25:14] [INFO ] Invariant cache hit.
[2024-05-28 12:25:15] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-28 12:25:15] [INFO ] Redundant transitions in 48 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 12:25:15] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:18] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:25:18] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:25:18] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-28 12:25:18] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:25:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:25:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:25:21] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:25:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:25:23] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-28 12:25:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:25:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:25:23] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:25:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:25:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:25:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:25:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:25:25] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:25:29] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:25:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 12:25:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:25:33] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 19/257 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:34] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:25:35] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:39] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/982 variables, and 260 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 178/180 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 178/178 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 82/260 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (OVERLAPS) 2/501 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:49] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:25:50] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:25:50] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:25:50] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 12:25:53] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:25:54] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 481/982 variables, 501/769 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 478/1247 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:26:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:26:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:26:09] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:26:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:26:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:26:11] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:26:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:26:12] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/982 variables, and 1255 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 96/96 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_CTL mode, iteration 1 : 501/1091 places, 481/1071 transitions.
Applied a total of 0 rules in 10 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 60895 ms. Remains : 501/1091 places, 481/1071 transitions.
[2024-05-28 12:26:15] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:26:15] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:26:15] [INFO ] Input system was already deterministic with 481 transitions.
RANDOM walk for 416 steps (0 resets) in 6 ms. (59 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020B-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 12:26:15] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:26:15] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:26:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2757886713128245061.gal : 2 ms
[2024-05-28 12:26:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12765220860536575870.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2757886713128245061.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12765220860536575870.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1064 transition count 1044
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1064 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1063 transition count 1043
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1063 transition count 1043
Applied a total of 56 rules in 60 ms. Remains 1063 /1091 variables (removed 28) and now considering 1043/1071 (removed 28) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2024-05-28 12:26:15] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:26:15] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-28 12:26:15] [INFO ] Invariant cache hit.
[2024-05-28 12:26:16] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 1042 sub problems to find dead transitions.
[2024-05-28 12:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1062 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (OVERLAPS) 1/1063 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-05-28 12:26:46] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:26:46] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:26:46] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Starting structural reductions in LTL mode, iteration 1 : 1063/1091 places, 1043/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31403 ms. Remains : 1063/1091 places, 1043/1071 transitions.
[2024-05-28 12:26:46] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:26:46] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:26:46] [INFO ] Input system was already deterministic with 1043 transitions.
[2024-05-28 12:26:46] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:26:46] [INFO ] Flatten gal took : 25 ms
[2024-05-28 12:26:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9926793564221544848.gal : 3 ms
[2024-05-28 12:26:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14498981632244215999.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/CTLFireability9926793564221544848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14498981632244215999.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 12:27:16] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:27:16] [INFO ] Applying decomposition
[2024-05-28 12:27:16] [INFO ] Flatten gal took : 21 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/graph5743997998269247798.txt' '-o' '/tmp/graph5743997998269247798.bin' '-w' '/tmp/graph5743997998269247798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5743997998269247798.bin' '-l' '-1' '-v' '-w' '/tmp/graph5743997998269247798.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:27:17] [INFO ] Decomposing Gal with order
[2024-05-28 12:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:27:17] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:27:17] [INFO ] Flatten gal took : 39 ms
[2024-05-28 12:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6471582312214939418.gal : 8 ms
[2024-05-28 12:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1211734804147280771.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/CTLFireability6471582312214939418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1211734804147280771.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 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 66 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 12:27:47] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 12:27:47] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-28 12:27:47] [INFO ] Invariant cache hit.
[2024-05-28 12:27:48] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 12:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/2108 variables, and 181 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1064 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:28:33] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:28:34] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-05-28 12:28:35] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-05-28 12:28:36] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 3 ms to minimize.
[2024-05-28 12:28:36] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 3 ms to minimize.
[2024-05-28 12:28:36] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-05-28 12:28:37] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 4 ms to minimize.
[2024-05-28 12:28:38] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 4 ms to minimize.
[2024-05-28 12:28:38] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 4 ms to minimize.
[2024-05-28 12:28:39] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 4 ms to minimize.
[2024-05-28 12:28:39] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 4 ms to minimize.
[2024-05-28 12:28:40] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 4 ms to minimize.
[2024-05-28 12:28:40] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 5 ms to minimize.
[2024-05-28 12:28:41] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1064 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:28:41] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 4 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:28:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:28:47] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 4 ms to minimize.
[2024-05-28 12:28:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:28:48] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 7 ms to minimize.
[2024-05-28 12:28:48] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 5 ms to minimize.
SMT process timed out in 60228ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1091 places, 1044/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61441 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-05-28 12:28:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:28:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:28:48] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-05-28 12:28:48] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:28:48] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17446211805976462716.gal : 4 ms
[2024-05-28 12:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14319017164673718627.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/CTLFireability17446211805976462716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14319017164673718627.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 12:29:18] [INFO ] Flatten gal took : 27 ms
[2024-05-28 12:29:18] [INFO ] Applying decomposition
[2024-05-28 12:29:18] [INFO ] Flatten gal took : 23 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/graph6057359042824859511.txt' '-o' '/tmp/graph6057359042824859511.bin' '-w' '/tmp/graph6057359042824859511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6057359042824859511.bin' '-l' '-1' '-v' '-w' '/tmp/graph6057359042824859511.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:29:18] [INFO ] Decomposing Gal with order
[2024-05-28 12:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:29:18] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:29:19] [INFO ] Flatten gal took : 37 ms
[2024-05-28 12:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16213861932195851645.gal : 8 ms
[2024-05-28 12:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15835219863763369961.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/CTLFireability16213861932195851645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15835219863763369961.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 LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1067 transition count 1047
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1067 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1066 transition count 1046
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1066 transition count 1046
Applied a total of 50 rules in 69 ms. Remains 1066 /1091 variables (removed 25) and now considering 1046/1071 (removed 25) transitions.
// Phase 1: matrix 1046 rows 1066 cols
[2024-05-28 12:29:49] [INFO ] Computed 181 invariants in 6 ms
[2024-05-28 12:29:49] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-28 12:29:49] [INFO ] Invariant cache hit.
[2024-05-28 12:29:50] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2024-05-28 12:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1065 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 1 (OVERLAPS) 1/1066 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:30:19] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-28 12:30:20] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-28 12:30:20] [INFO ] Deduced a trap composed of 47 places in 66 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 1066/2112 variables, and 186 constraints, problems are : Problem set: 0 solved, 1045 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1066 constraints, PredecessorRefiner: 1045/1045 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1045 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1065 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 1 (OVERLAPS) 1/1066 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1066 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
[2024-05-28 12:30:37] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:30:37] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-28 12:30:37] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:30:38] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:30:38] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 3 ms to minimize.
[2024-05-28 12:30:38] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-05-28 12:30:39] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-28 12:30:39] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 4 ms to minimize.
[2024-05-28 12:30:40] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-28 12:30:40] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-28 12:30:41] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 4 ms to minimize.
[2024-05-28 12:30:41] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 4 ms to minimize.
[2024-05-28 12:30:42] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 5 ms to minimize.
[2024-05-28 12:30:43] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 5 ms to minimize.
[2024-05-28 12:30:43] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 4 ms to minimize.
[2024-05-28 12:30:44] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 5 ms to minimize.
[2024-05-28 12:30:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:30:44] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 5 ms to minimize.
[2024-05-28 12:30:44] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 5 ms to minimize.
[2024-05-28 12:30:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1066 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 1045 unsolved
[2024-05-28 12:30:50] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 1)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 1)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 1)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 1)
(s513 0)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 1)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 0)
(s564 1)
(s565 0)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 1)
(s574 0)
(s575 0)
(s576 0)
(s577 1)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 1)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 1)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 0)
(s628 0)
(s629 1)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 1)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 0)
(s679 0)
(s680 0)
(s681 1)
(s682 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1066/2112 variables, and 207 constraints, problems are : Problem set: 0 solved, 1045 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1066 constraints, PredecessorRefiner: 0/1045 constraints, Known Traps: 26/26 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 1066/1091 places, 1046/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61341 ms. Remains : 1066/1091 places, 1046/1071 transitions.
[2024-05-28 12:30:50] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:30:50] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:30:50] [INFO ] Input system was already deterministic with 1046 transitions.
[2024-05-28 12:30:50] [INFO ] Flatten gal took : 30 ms
[2024-05-28 12:30:50] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15565837796272312419.gal : 3 ms
[2024-05-28 12:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3616301237946748330.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/CTLFireability15565837796272312419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3616301237946748330.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 12:31:20] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:31:20] [INFO ] Applying decomposition
[2024-05-28 12:31:20] [INFO ] Flatten gal took : 22 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/graph3019062276474723566.txt' '-o' '/tmp/graph3019062276474723566.bin' '-w' '/tmp/graph3019062276474723566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3019062276474723566.bin' '-l' '-1' '-v' '-w' '/tmp/graph3019062276474723566.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:31:20] [INFO ] Decomposing Gal with order
[2024-05-28 12:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:31:20] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:31:20] [INFO ] Flatten gal took : 39 ms
[2024-05-28 12:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:31:20] [INFO ] Time to serialize gal into /tmp/CTLFireability9791646479000245632.gal : 9 ms
[2024-05-28 12:31:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7939799196136011974.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/CTLFireability9791646479000245632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7939799196136011974.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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1090 transition count 969
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 989 transition count 969
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 989 transition count 868
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 888 transition count 868
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 432 place count 860 transition count 840
Iterating global reduction 2 with 28 rules applied. Total rules applied 460 place count 860 transition count 840
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 460 place count 860 transition count 827
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 486 place count 847 transition count 827
Performed 345 Post agglomeration using F-continuation condition.Transition count delta: 345
Deduced a syphon composed of 345 places in 1 ms
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 2 with 690 rules applied. Total rules applied 1176 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1178 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 480
Applied a total of 1179 rules in 89 ms. Remains 499 /1091 variables (removed 592) and now considering 480/1071 (removed 591) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 12:31:51] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 12:31:51] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-28 12:31:51] [INFO ] Invariant cache hit.
[2024-05-28 12:31:51] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-28 12:31:51] [INFO ] Redundant transitions in 44 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 12:31:51] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:31:55] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:31:56] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:31:57] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:31:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:31:58] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:31:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:31:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 12:31:58] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:31:59] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 12:32:00] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 12:32:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:32:01] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:32:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:32:05] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:32:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 12:32:06] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:32:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-28 12:32:06] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-28 12:32:07] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 12:32:07] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:32:08] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:32:09] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:32:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:32:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 12:32:10] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-28 12:32:10] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 12:32:11] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 12:32:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 12:32:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:32:13] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 12:32:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 12:32:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 478 unsolved
SMT process timed out in 30075ms, After SMT, problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 30079ms
Starting structural reductions in SI_CTL mode, iteration 1 : 499/1091 places, 479/1071 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 30816 ms. Remains : 499/1091 places, 479/1071 transitions.
[2024-05-28 12:32:21] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:32:21] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:32:21] [INFO ] Input system was already deterministic with 479 transitions.
[2024-05-28 12:32:21] [INFO ] Flatten gal took : 20 ms
RANDOM walk for 5023 steps (2 resets) in 32 ms. (152 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-020B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 12:32:21] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:32:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16036507552248511630.gal : 3 ms
[2024-05-28 12:32:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5758865759875387649.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16036507552248511630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5758865759875387649.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Applied a total of 52 rules in 43 ms. Remains 1065 /1091 variables (removed 26) and now considering 1045/1071 (removed 26) transitions.
// Phase 1: matrix 1045 rows 1065 cols
[2024-05-28 12:32:21] [INFO ] Computed 181 invariants in 6 ms
[2024-05-28 12:32:22] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-28 12:32:22] [INFO ] Invariant cache hit.
[2024-05-28 12:32:23] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 1044 sub problems to find dead transitions.
[2024-05-28 12:32:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1064 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/1065 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-28 12:32:52] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:32:53] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1065/2110 variables, and 183 constraints, problems are : Problem set: 0 solved, 1044 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1065 constraints, PredecessorRefiner: 1044/1044 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1044 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1064 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 1 (OVERLAPS) 1/1065 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1065 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-28 12:33:08] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-28 12:33:09] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 12:33:09] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:33:09] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:33:10] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:33:10] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-28 12:33:10] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-28 12:33:11] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-28 12:33:11] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-28 12:33:12] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2024-05-28 12:33:12] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 3 ms to minimize.
[2024-05-28 12:33:13] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 4 ms to minimize.
[2024-05-28 12:33:13] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 4 ms to minimize.
[2024-05-28 12:33:14] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 5 ms to minimize.
[2024-05-28 12:33:14] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 5 ms to minimize.
[2024-05-28 12:33:15] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 5 ms to minimize.
[2024-05-28 12:33:16] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 5 ms to minimize.
[2024-05-28 12:33:16] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 5 ms to minimize.
[2024-05-28 12:33:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:33:16] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1065 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1044 unsolved
[2024-05-28 12:33:17] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-28 12:33:19] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:33:20] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 4 ms to minimize.
[2024-05-28 12:33:22] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 5 ms to minimize.
[2024-05-28 12:33:23] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:33:23] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-05-28 12:33:23] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:33:23] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 60229ms, After SMT, problems are : Problem set: 0 solved, 1044 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LTL mode, iteration 1 : 1065/1091 places, 1045/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61437 ms. Remains : 1065/1091 places, 1045/1071 transitions.
[2024-05-28 12:33:23] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:33:23] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:33:23] [INFO ] Input system was already deterministic with 1045 transitions.
[2024-05-28 12:33:23] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:33:23] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:33:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2623414272346096685.gal : 3 ms
[2024-05-28 12:33:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1721100263153423575.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/CTLFireability2623414272346096685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1721100263153423575.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 12:33:53] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:33:53] [INFO ] Applying decomposition
[2024-05-28 12:33:53] [INFO ] Flatten gal took : 22 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/graph13029167542283682588.txt' '-o' '/tmp/graph13029167542283682588.bin' '-w' '/tmp/graph13029167542283682588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13029167542283682588.bin' '-l' '-1' '-v' '-w' '/tmp/graph13029167542283682588.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:33:53] [INFO ] Decomposing Gal with order
[2024-05-28 12:33:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:33:53] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:33:53] [INFO ] Flatten gal took : 37 ms
[2024-05-28 12:33:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:33:53] [INFO ] Time to serialize gal into /tmp/CTLFireability30135503790758880.gal : 8 ms
[2024-05-28 12:33:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4294388416682679368.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/CTLFireability30135503790758880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4294388416682679368.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 -...260
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 : 1091/1091 places, 1071/1071 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1090 transition count 973
Reduce places removed 97 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 993 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 992 transition count 972
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 196 place count 992 transition count 871
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 398 place count 891 transition count 871
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 424 place count 865 transition count 845
Iterating global reduction 3 with 26 rules applied. Total rules applied 450 place count 865 transition count 845
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 450 place count 865 transition count 835
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 470 place count 855 transition count 835
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1154 place count 513 transition count 493
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1156 place count 511 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1157 place count 510 transition count 491
Applied a total of 1157 rules in 88 ms. Remains 510 /1091 variables (removed 581) and now considering 491/1071 (removed 580) transitions.
// Phase 1: matrix 491 rows 510 cols
[2024-05-28 12:34:23] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 12:34:24] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-28 12:34:24] [INFO ] Invariant cache hit.
[2024-05-28 12:34:24] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2024-05-28 12:34:24] [INFO ] Redundant transitions in 44 ms returned [490]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 486 sub problems to find dead transitions.
// Phase 1: matrix 490 rows 510 cols
[2024-05-28 12:34:24] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:34:28] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-28 12:34:29] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:34:29] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-05-28 12:34:29] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:34:29] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:34:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:34:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:34:32] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (OVERLAPS) 3/510 variables, 138/195 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:42] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-28 12:34:42] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 12:34:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 12:34:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-28 12:34:45] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-28 12:34:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:34:49] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-28 12:34:50] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 5 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 12:34:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 12:34:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 12:34:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 486 unsolved
[2024-05-28 12:34:53] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-28 12:34:53] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 12:34:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:34:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 12:34:54] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 30102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 510/1091 places, 490/1071 transitions.
Applied a total of 0 rules in 12 ms. Remains 510 /510 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 30845 ms. Remains : 510/1091 places, 490/1071 transitions.
[2024-05-28 12:34:54] [INFO ] Flatten gal took : 23 ms
[2024-05-28 12:34:54] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:34:54] [INFO ] Input system was already deterministic with 490 transitions.
[2024-05-28 12:34:54] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:34:54] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:34:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1888744835817168685.gal : 2 ms
[2024-05-28 12:34:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8515753940867703994.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/CTLFireability1888744835817168685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8515753940867703994.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 12:35:24] [INFO ] Flatten gal took : 14 ms
[2024-05-28 12:35:24] [INFO ] Applying decomposition
[2024-05-28 12:35:24] [INFO ] Flatten gal took : 14 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/graph9075502124590592953.txt' '-o' '/tmp/graph9075502124590592953.bin' '-w' '/tmp/graph9075502124590592953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9075502124590592953.bin' '-l' '-1' '-v' '-w' '/tmp/graph9075502124590592953.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:35:24] [INFO ] Decomposing Gal with order
[2024-05-28 12:35:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:35:24] [INFO ] Removed a total of 325 redundant transitions.
[2024-05-28 12:35:24] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 8 ms.
[2024-05-28 12:35:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9079554697201661953.gal : 3 ms
[2024-05-28 12:35:25] [INFO ] Time to serialize properties into /tmp/CTLFireability18385746980275892381.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/CTLFireability9079554697201661953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18385746980275892381.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 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 56 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 12:35:55] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 12:35:55] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-28 12:35:55] [INFO ] Invariant cache hit.
[2024-05-28 12:35:56] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 12:35:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:36:25] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-28 12:36:25] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 12:36:26] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 2 ms to minimize.
[2024-05-28 12:36:26] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1091 places, 1044/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31443 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-05-28 12:36:26] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:36:26] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:36:26] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-05-28 12:36:26] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:36:26] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:36:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1884147107561917566.gal : 4 ms
[2024-05-28 12:36:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17466383908838775435.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/CTLFireability1884147107561917566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17466383908838775435.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 12:36:56] [INFO ] Flatten gal took : 40 ms
[2024-05-28 12:36:56] [INFO ] Applying decomposition
[2024-05-28 12:36:56] [INFO ] Flatten gal took : 22 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/graph9438779425715393051.txt' '-o' '/tmp/graph9438779425715393051.bin' '-w' '/tmp/graph9438779425715393051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9438779425715393051.bin' '-l' '-1' '-v' '-w' '/tmp/graph9438779425715393051.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:36:56] [INFO ] Decomposing Gal with order
[2024-05-28 12:36:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:36:56] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:36:56] [INFO ] Flatten gal took : 52 ms
[2024-05-28 12:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11470719899266208529.gal : 8 ms
[2024-05-28 12:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3704144126280867344.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11470719899266208529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3704144126280867344.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 : 1091/1091 places, 1071/1071 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1065 transition count 1045
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1065 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1064 transition count 1044
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1064 transition count 1044
Applied a total of 54 rules in 61 ms. Remains 1064 /1091 variables (removed 27) and now considering 1044/1071 (removed 27) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2024-05-28 12:37:27] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 12:37:27] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-28 12:37:27] [INFO ] Invariant cache hit.
[2024-05-28 12:37:28] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 1043 sub problems to find dead transitions.
[2024-05-28 12:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:37:57] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-28 12:37:57] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-28 12:37:58] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1064/2108 variables, and 184 constraints, problems are : Problem set: 0 solved, 1043 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 0/1064 constraints, PredecessorRefiner: 1043/1043 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1043 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1063 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 1 (OVERLAPS) 1/1064 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1064 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:38:13] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:38:14] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-28 12:38:14] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-28 12:38:14] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
[2024-05-28 12:38:15] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 3 ms to minimize.
[2024-05-28 12:38:15] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 3 ms to minimize.
[2024-05-28 12:38:15] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-05-28 12:38:16] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-28 12:38:16] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-28 12:38:16] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 3 ms to minimize.
[2024-05-28 12:38:17] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2024-05-28 12:38:17] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 4 ms to minimize.
[2024-05-28 12:38:18] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 4 ms to minimize.
[2024-05-28 12:38:18] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 4 ms to minimize.
[2024-05-28 12:38:19] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 4 ms to minimize.
[2024-05-28 12:38:20] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 4 ms to minimize.
[2024-05-28 12:38:20] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 5 ms to minimize.
[2024-05-28 12:38:20] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 12:38:21] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 5 ms to minimize.
[2024-05-28 12:38:21] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1064 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2024-05-28 12:38:26] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2024-05-28 12:38:27] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 12:38:27] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 12:38:27] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-28 12:38:28] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 6 ms to minimize.
[2024-05-28 12:38:28] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 7 ms to minimize.
SMT process timed out in 60439ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 1064/1091 places, 1044/1071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61563 ms. Remains : 1064/1091 places, 1044/1071 transitions.
[2024-05-28 12:38:28] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:38:28] [INFO ] Flatten gal took : 22 ms
[2024-05-28 12:38:28] [INFO ] Input system was already deterministic with 1044 transitions.
[2024-05-28 12:38:28] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:38:28] [INFO ] Flatten gal took : 21 ms
[2024-05-28 12:38:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10047711806547590999.gal : 4 ms
[2024-05-28 12:38:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1721012180819160819.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/CTLFireability10047711806547590999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1721012180819160819.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 12:38:58] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:38:58] [INFO ] Applying decomposition
[2024-05-28 12:38:58] [INFO ] Flatten gal took : 22 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/graph11258185237182245377.txt' '-o' '/tmp/graph11258185237182245377.bin' '-w' '/tmp/graph11258185237182245377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11258185237182245377.bin' '-l' '-1' '-v' '-w' '/tmp/graph11258185237182245377.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:38:58] [INFO ] Decomposing Gal with order
[2024-05-28 12:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:38:58] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:38:58] [INFO ] Flatten gal took : 35 ms
[2024-05-28 12:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 12:38:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9827232326695671736.gal : 7 ms
[2024-05-28 12:38:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17102204945204810597.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/CTLFireability9827232326695671736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17102204945204810597.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 12:39:29] [INFO ] Flatten gal took : 26 ms
[2024-05-28 12:39:29] [INFO ] Flatten gal took : 24 ms
[2024-05-28 12:39:29] [INFO ] Applying decomposition
[2024-05-28 12:39:29] [INFO ] Flatten gal took : 23 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/graph15685227713315213279.txt' '-o' '/tmp/graph15685227713315213279.bin' '-w' '/tmp/graph15685227713315213279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15685227713315213279.bin' '-l' '-1' '-v' '-w' '/tmp/graph15685227713315213279.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:39:29] [INFO ] Decomposing Gal with order
[2024-05-28 12:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:39:29] [INFO ] Removed a total of 460 redundant transitions.
[2024-05-28 12:39:29] [INFO ] Flatten gal took : 36 ms
[2024-05-28 12:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 12:39:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17098500931214864124.gal : 7 ms
[2024-05-28 12:39:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11393157353171068536.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/CTLFireability17098500931214864124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11393157353171068536.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 12:53:20] [INFO ] Applying decomposition
[2024-05-28 12:53:20] [INFO ] Flatten gal took : 30 ms
[2024-05-28 12:53:20] [INFO ] Decomposing Gal with order
[2024-05-28 12:53:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:53:20] [INFO ] Removed a total of 320 redundant transitions.
[2024-05-28 12:53:20] [INFO ] Flatten gal took : 35 ms
[2024-05-28 12:53:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 10 ms.
[2024-05-28 12:53:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1900312987247360328.gal : 7 ms
[2024-05-28 12:53:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6000449741525121349.ctl : 5 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/CTLFireability1900312987247360328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6000449741525121349.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 13:00:33] [INFO ] Flatten gal took : 28 ms
[2024-05-28 13:00:33] [INFO ] Input system was already deterministic with 1071 transitions.
[2024-05-28 13:00:33] [INFO ] Transformed 1091 places.
[2024-05-28 13:00:33] [INFO ] Transformed 1071 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 13:00:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2404602997148423781.gal : 4 ms
[2024-05-28 13:00:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6848300576171018436.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/CTLFireability2404602997148423781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6848300576171018436.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 3592772 ms.

BK_STOP 1716901844083

--------------------
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="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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-171683760400106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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