Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716333775518

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:22:56] [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-21 23:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:22:57] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-21 23:22:57] [INFO ] Transformed 368 places.
[2024-05-21 23:22:57] [INFO ] Transformed 319 transitions.
[2024-05-21 23:22:57] [INFO ] Found NUPN structural information;
[2024-05-21 23:22:57] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 1 transitions.
Support contains 115 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 330 transition count 283
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 330 transition count 283
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 86 place count 316 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 100 place count 316 transition count 269
Applied a total of 100 rules in 70 ms. Remains 316 /367 variables (removed 51) and now considering 269/318 (removed 49) transitions.
// Phase 1: matrix 269 rows 316 cols
[2024-05-21 23:22:57] [INFO ] Computed 55 invariants in 20 ms
[2024-05-21 23:22:57] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-21 23:22:57] [INFO ] Invariant cache hit.
[2024-05-21 23:22:57] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-21 23:22:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 27 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 4 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 4 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 10/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 269/585 variables, 316/474 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 500 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 129/184 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 3 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 3 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 13/217 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 269/585 variables, 316/552 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/585 variables, 268/820 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/585 variables, 20/840 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 840 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 201/201 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 316/367 places, 269/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60814 ms. Remains : 316/367 places, 269/318 transitions.
Support contains 115 out of 316 places after structural reductions.
[2024-05-21 23:23:58] [INFO ] Flatten gal took : 63 ms
[2024-05-21 23:23:58] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:23:58] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 113 out of 316 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (376 resets) in 1391 ms. (28 steps per ms) remains 24/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
[2024-05-21 23:23:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 174/220 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 74/294 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 254/548 variables, 294/349 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 7 (OVERLAPS) 34/582 variables, 20/369 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/369 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp41 is UNSAT
At refinement iteration 9 (OVERLAPS) 3/585 variables, 2/371 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/585 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 371 constraints, problems are : Problem set: 3 solved, 21 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 171/208 variables, 35/35 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 3/38 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/40 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 3/43 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/44 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 84/292 variables, 20/64 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 3/67 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/68 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/69 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/69 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 253/545 variables, 292/361 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 11/372 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 19/391 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/545 variables, 0/391 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 37/582 variables, 22/413 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/582 variables, 10/423 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 6395ms, After SMT, problems are : Problem set: 3 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 269/269 transitions.
Graph (complete) has 650 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 315 transition count 234
Reduce places removed 33 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 282 transition count 230
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 278 transition count 230
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 76 place count 278 transition count 180
Deduced a syphon composed of 50 places in 13 ms
Ensure Unique test removed 10 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 186 place count 218 transition count 180
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 207 place count 197 transition count 159
Iterating global reduction 3 with 21 rules applied. Total rules applied 228 place count 197 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 230 place count 197 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 232 place count 196 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 232 place count 196 transition count 155
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 195 transition count 155
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 366 place count 128 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 127 transition count 89
Applied a total of 367 rules in 114 ms. Remains 127 /316 variables (removed 189) and now considering 89/269 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 127/316 places, 89/269 transitions.
RANDOM walk for 40000 steps (8 resets) in 855 ms. (46 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
// Phase 1: matrix 89 rows 127 cols
[2024-05-21 23:24:06] [INFO ] Computed 44 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/115 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/123 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 87/210 variables, 123/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/215 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/216 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/216 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/40 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 75/115 variables, 35/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/123 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 87/210 variables, 123/166 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 1/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/215 variables, 3/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/216 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/216 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 173 constraints, problems are : Problem set: 1 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 401ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 3414 steps, including 214 resets, run visited all 1 properties in 10 ms. (steps per millisecond=341 )
Parikh walk visited 1 properties in 19 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:24:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:24:06] [INFO ] Flatten gal took : 18 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:24:06] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:24:06] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 94 out of 316 places (down from 99) after GAL structural reductions.
Computed a total of 309 stabilizing places and 259 stable transitions
Graph (complete) has 650 edges and 316 vertex of which 315 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 275 transition count 227
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 275 transition count 227
Applied a total of 83 rules in 25 ms. Remains 275 /316 variables (removed 41) and now considering 227/269 (removed 42) transitions.
// Phase 1: matrix 227 rows 275 cols
[2024-05-21 23:24:06] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:24:07] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 23:24:07] [INFO ] Invariant cache hit.
[2024-05-21 23:24:07] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-21 23:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 12 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 5 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/502 variables, 275/384 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/502 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (OVERLAPS) 0/502 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 389 constraints, problems are : Problem set: 0 solved, 226 unsolved in 24826 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 59/114 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/502 variables, 275/398 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 226/624 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/644 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 10/654 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 9/663 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 663 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 107/107 constraints]
After SMT, in 54914ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 54917ms
Starting structural reductions in LTL mode, iteration 1 : 275/316 places, 227/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55447 ms. Remains : 275/316 places, 227/269 transitions.
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:25:02] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9249927074419221307.gal : 4 ms
[2024-05-21 23:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14835646435213999976.ctl : 4 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/CTLFireability9249927074419221307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14835646435213999976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48168e+17,4.23346,114216,2,50114,5,268441,6,0,1327,615559,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:25:32] [INFO ] Applying decomposition
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 15 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/graph10733205736782920655.txt' '-o' '/tmp/graph10733205736782920655.bin' '-w' '/tmp/graph10733205736782920655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10733205736782920655.bin' '-l' '-1' '-v' '-w' '/tmp/graph10733205736782920655.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:32] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 71 ms
[2024-05-21 23:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-21 23:25:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6311382781498882563.gal : 21 ms
[2024-05-21 23:25:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10726467844406997500.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/CTLFireability6311382781498882563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10726467844406997500.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48168e+17,0.347949,13676,2434,28,17182,452,568,41347,41,1004,0


Converting to forward existential form...Done !
original formula: (AG(A((i0.u35.p111==1) U !((AX((i5.u84.p307==1)) + EG((i17.i1.u89.p333==1)))))) * A((i14.i2.u68.p225==1) U A(!(AF((i2.u91.p344==1))) U !(...244
=> equivalent forward existential formula: ((([((FwdU(FwdU(Init,TRUE),!(!((!(EX(!((i5.u84.p307==1)))) + EG((i17.i1.u89.p333==1)))))) * !((i0.u35.p111==1)))...1960
Reverse transition relation is NOT exact ! Due to transitions t105, t157, t166, t205, t207, t209, t218, i0.u35.t116, i1.i0.u37.t112, i1.i1.t87, i1.i1.u57.t...909
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 267 transition count 219
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 267 transition count 219
Applied a total of 99 rules in 31 ms. Remains 267 /316 variables (removed 49) and now considering 219/269 (removed 50) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-21 23:26:02] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:26:03] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-21 23:26:03] [INFO ] Invariant cache hit.
[2024-05-21 23:26:03] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:26:11] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:26:12] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13350 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:21] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 11 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 43414ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 43416ms
Starting structural reductions in LTL mode, iteration 1 : 267/316 places, 219/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44007 ms. Remains : 267/316 places, 219/269 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8852417775501056435.gal : 2 ms
[2024-05-21 23:26:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3932232429736561558.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/CTLFireability8852417775501056435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3932232429736561558.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,4.02233,94612,2,39435,5,233790,6,0,1287,522191,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:27:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:27:17] [INFO ] Applying decomposition
[2024-05-21 23:27:17] [INFO ] Flatten gal took : 8 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/graph11344334126876729148.txt' '-o' '/tmp/graph11344334126876729148.bin' '-w' '/tmp/graph11344334126876729148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11344334126876729148.bin' '-l' '-1' '-v' '-w' '/tmp/graph11344334126876729148.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:17] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-21 23:27:17] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14930668160582121654.gal : 6 ms
[2024-05-21 23:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8773358284058670589.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/CTLFireability14930668160582121654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8773358284058670589.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,0.264541,11840,1905,25,14641,356,530,27174,35,756,0


Converting to forward existential form...Done !
original formula: EF(((i14.u49.p147==1) * EX(EG(EX((((i5.u13.p37==1)&&(i17.u58.p179==1))&&(i5.u80.p292==1)))))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * (i14.u49.p147==1))),EX((((i5.u13.p37==1)&&(i17.u58.p179==1))&&(i5.u80.p292==1))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t158, t197, t199, t200, t201, t204, t210, i0.u74.t33, i0.u75.t30, i1.i0.t99, i1.i0.u39.t102, ...849
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,1.37685,55136,1,0,111557,356,3127,161066,166,756,275808
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 275 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 275 transition count 227
Applied a total of 83 rules in 23 ms. Remains 275 /316 variables (removed 41) and now considering 227/269 (removed 42) transitions.
// Phase 1: matrix 227 rows 275 cols
[2024-05-21 23:27:18] [INFO ] Computed 55 invariants in 16 ms
[2024-05-21 23:27:18] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 23:27:18] [INFO ] Invariant cache hit.
[2024-05-21 23:27:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-05-21 23:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/502 variables, 275/365 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 6/371 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 0/502 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 372 constraints, problems are : Problem set: 0 solved, 226 unsolved in 18345 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 227/502 variables, 275/380 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 226/606 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 13/619 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 623 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 67/67 constraints]
After SMT, in 48397ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 48411ms
Starting structural reductions in LTL mode, iteration 1 : 275/316 places, 227/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48868 ms. Remains : 275/316 places, 227/269 transitions.
[2024-05-21 23:28:07] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:28:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:28:07] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-21 23:28:07] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:28:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:28:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16228643002307613782.gal : 14 ms
[2024-05-21 23:28:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15643516616298951550.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/CTLFireability16228643002307613782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15643516616298951550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41139e+17,3.91141,94392,2,40165,5,235229,6,0,1327,515235,0


Converting to forward existential form...Done !
original formula: (AG((p148==0)) * !(E(((p125==1)||(p278==1)) U (A(EX((p316==1)) U A((p69==1) U (p333==1))) + (p350==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p148==0)))] = FALSE * ([((FwdU(Init,((p125==1)||(p278==1))) * !(EG(!(!((E(!((p333==1)) U...461
Hit Full ! (commute/partial/dont) 223/0/4
Detected timeout of ITS tools.
[2024-05-21 23:28:37] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:28:37] [INFO ] Applying decomposition
[2024-05-21 23:28:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13084813257567283682.txt' '-o' '/tmp/graph13084813257567283682.bin' '-w' '/tmp/graph13084813257567283682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13084813257567283682.bin' '-l' '-1' '-v' '-w' '/tmp/graph13084813257567283682.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:37] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:37] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-21 23:28:37] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-21 23:28:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4745775761320109739.gal : 6 ms
[2024-05-21 23:28:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10261792454103420418.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/CTLFireability4745775761320109739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10261792454103420418.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41139e+17,1.76973,53356,6498,32,66117,421,568,208188,42,963,0


Converting to forward existential form...Done !
original formula: (AG((i14.i1.u50.p148==0)) * !(E(((i0.i0.u40.p125==1)||(i17.u77.p278==1)) U (A(EX((i5.i1.u85.p316==1)) U A((i5.i0.u22.p69==1) U (i17.u88.p...188
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i14.i1.u50.p148==0)))] = FALSE * ([((FwdU(Init,((i0.i0.u40.p125==1)||(i17.u77.p278==1)))...628
Reverse transition relation is NOT exact ! Due to transitions t106, t161, t166, t208, t209, t212, t218, i0.i0.u39.t109, i0.i0.u43.t102, i0.i0.u64.t67, i0.i...904
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 69 place count 277 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 79 place count 277 transition count 229
Applied a total of 79 rules in 27 ms. Remains 277 /316 variables (removed 39) and now considering 229/269 (removed 40) transitions.
// Phase 1: matrix 229 rows 277 cols
[2024-05-21 23:29:08] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:29:08] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 23:29:08] [INFO ] Invariant cache hit.
[2024-05-21 23:29:08] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-21 23:29:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 14 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:29:15] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 229/506 variables, 277/390 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (OVERLAPS) 0/506 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 397 constraints, problems are : Problem set: 0 solved, 228 unsolved in 19223 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 65/120 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:29:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 229/506 variables, 277/405 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 228/633 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 20/653 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 13/666 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 5/671 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/506 variables, and 671 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 111/111 constraints]
After SMT, in 49277ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 49285ms
Starting structural reductions in LTL mode, iteration 1 : 277/316 places, 229/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49750 ms. Remains : 277/316 places, 229/269 transitions.
[2024-05-21 23:29:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:29:57] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:29:57] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-21 23:29:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:29:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability416413851595202604.gal : 1 ms
[2024-05-21 23:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1879591507456212503.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/CTLFireability416413851595202604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1879591507456212503.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52362e+17,6.31123,148336,2,70568,5,345581,6,0,1337,834681,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52362e+17,2.18796,68824,8644,25,105749,364,522,242338,38,735,0


Converting to forward existential form...Done !
original formula: (E((EG((((i8.u19.p46==1)&&(i2.u65.p203==1))&&(i21.u80.p367==1))) + (i19.u60.p180==1)) U EF(((AF((i16.u49.p141==1)) + A((i7.u16.p42==1) U ...389
=> equivalent forward existential formula: [FwdG(FwdU((Init * E((EG((((i8.u19.p46==1)&&(i2.u65.p203==1))&&(i21.u80.p367==1))) + (i19.u60.p180==1)) U E(TRUE...528
Reverse transition relation is NOT exact ! Due to transitions t157, t168, t207, t209, t211, t214, t220, i0.t103, i0.u40.t110, i0.u42.t106, i1.u36.t118, i1....859
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 75 place count 273 transition count 225
Iterating global reduction 1 with 12 rules applied. Total rules applied 87 place count 273 transition count 225
Applied a total of 87 rules in 10 ms. Remains 273 /316 variables (removed 43) and now considering 225/269 (removed 44) transitions.
// Phase 1: matrix 225 rows 273 cols
[2024-05-21 23:30:58] [INFO ] Computed 55 invariants in 4 ms
[2024-05-21 23:30:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:30:58] [INFO ] Invariant cache hit.
[2024-05-21 23:30:58] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 23:30:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:00] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:02] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:03] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:31:05] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:06] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:31:07] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:08] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (OVERLAPS) 225/498 variables, 273/396 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 403 constraints, problems are : Problem set: 0 solved, 224 unsolved in 21676 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 75/130 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/498 variables, 273/413 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 224/637 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 15/672 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 8/680 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 680 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 128/128 constraints]
After SMT, in 51727ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 51731ms
Starting structural reductions in LTL mode, iteration 1 : 273/316 places, 225/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52085 ms. Remains : 273/316 places, 225/269 transitions.
[2024-05-21 23:31:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:31:50] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:31:50] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 23:31:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:31:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:31:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11115828588830451612.gal : 2 ms
[2024-05-21 23:31:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15647209566361405826.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/CTLFireability11115828588830451612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15647209566361405826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49622e+17,5.80415,138940,2,61714,5,331762,6,0,1317,775581,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49622e+17,0.313656,12100,2324,30,13211,349,563,30076,41,690,0


Converting to forward existential form...Done !
original formula: EX(EF((AX((i1.u26.p87==1)) + ((AX((i17.i1.u63.p202==1)) * (((i0.i1.u75.p257==0)||(i6.u17.p46==0))||((i13.u64.p208==0)||(i21.u78.p367==0))...201
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(!((i1.u26.p87==1)))))] != FALSE + [(((FwdU(EY(Init),TRUE) * ((i5.i1.u58.p185==0)||...300
Reverse transition relation is NOT exact ! Due to transitions t153, t162, t203, t205, t206, t207, t210, i0.i0.u42.t98, i0.i0.u76.t30, i0.i1.t34, i0.i1.u75....900
(forward)formula 0,1,2.25241,86284,1,0,174264,358,3547,270539,187,942,411890
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Graph (trivial) has 181 edges and 316 vertex of which 7 / 316 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 642 edges and 310 vertex of which 309 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 308 transition count 207
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 256 transition count 207
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 106 place count 256 transition count 152
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 229 place count 188 transition count 152
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 262 place count 155 transition count 119
Iterating global reduction 2 with 33 rules applied. Total rules applied 295 place count 155 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 295 place count 155 transition count 116
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 302 place count 151 transition count 116
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 438 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 440 place count 80 transition count 48
Applied a total of 440 rules in 43 ms. Remains 80 /316 variables (removed 236) and now considering 48/269 (removed 221) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-05-21 23:32:22] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 23:32:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 23:32:22] [INFO ] Invariant cache hit.
[2024-05-21 23:32:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 182 ms to find 38 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/316 places, 48/269 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 29 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 25 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 25 transition count 30
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 37 place count 24 transition count 29
Applied a total of 37 rules in 11 ms. Remains 24 /42 variables (removed 18) and now considering 29/48 (removed 19) transitions.
// Phase 1: matrix 29 rows 24 cols
[2024-05-21 23:32:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-21 23:32:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 23:32:22] [INFO ] Invariant cache hit.
[2024-05-21 23:32:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/316 places, 29/269 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 301 ms. Remains : 24/316 places, 29/269 transitions.
[2024-05-21 23:32:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:22] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-21 23:32:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:22] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality629482080299756044.gal : 0 ms
[2024-05-21 23:32:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16000697404510120221.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/ReachabilityCardinality629482080299756044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16000697404510120221.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 7170 steps (2318 resets) in 42 ms. (166 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 283 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 283 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 283 transition count 235
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 80 place count 270 transition count 222
Iterating global reduction 1 with 13 rules applied. Total rules applied 93 place count 270 transition count 222
Applied a total of 93 rules in 24 ms. Remains 270 /316 variables (removed 46) and now considering 222/269 (removed 47) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-05-21 23:32:22] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 23:32:23] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:32:23] [INFO ] Invariant cache hit.
[2024-05-21 23:32:23] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 23:32:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/492 variables, 270/363 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 368 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16032 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 43/98 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/492 variables, 270/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 221/589 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:45] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 20/609 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 7/616 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/625 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 626 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 80/80 constraints]
After SMT, in 46070ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 46072ms
Starting structural reductions in LTL mode, iteration 1 : 270/316 places, 222/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46484 ms. Remains : 270/316 places, 222/269 transitions.
[2024-05-21 23:33:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:33:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:33:09] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 23:33:09] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:33:09] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:33:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4527491324623337788.gal : 2 ms
[2024-05-21 23:33:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18370093333388858986.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/CTLFireability4527491324623337788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18370093333388858986.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41962e+17,4.57374,97720,2,40498,5,240446,6,0,1302,538079,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41962e+17,0.306805,16036,2453,23,21304,332,505,43978,38,719,0


Converting to forward existential form...Done !
original formula: (EF(AX(((i6.u77.p281==1) * !(E((i17.u86.p333==1) U (i12.i1.u45.p142==1)))))) * EF(!(E((((i10.i0.u26.p88==1)&&(i12.i1.u67.p229==1))&&(i10....198
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(EX(!(((i6.u77.p281==1) * !(E((i17.u86.p333==1) U (i12.i1.u45.p142==1))))))))),TRUE) * ...262
Reverse transition relation is NOT exact ! Due to transitions t102, t156, t161, t200, t202, t204, t207, t213, i0.u35.t109, i0.u39.t101, i1.u37.t105, i2.u31...854
(forward)formula 0,1,13.3748,299572,1,0,498143,395,3883,1.05106e+06,188,996,811714
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 268 transition count 220
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 268 transition count 220
Applied a total of 97 rules in 12 ms. Remains 268 /316 variables (removed 48) and now considering 220/269 (removed 49) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 23:33:53] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:33:53] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 23:33:53] [INFO ] Invariant cache hit.
[2024-05-21 23:33:53] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 23:33:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 5 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/488 variables, 268/350 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:03] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 7/357 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/488 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 357 constraints, problems are : Problem set: 0 solved, 219 unsolved in 16009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/366 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/585 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 6/591 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 5/596 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 598 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 56/56 constraints]
After SMT, in 46060ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 46062ms
Starting structural reductions in LTL mode, iteration 1 : 268/316 places, 220/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46416 ms. Remains : 268/316 places, 220/269 transitions.
[2024-05-21 23:34:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:34:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:39] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 23:34:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:34:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:39] [INFO ] Time to serialize gal into /tmp/CTLFireability68333899240048432.gal : 2 ms
[2024-05-21 23:34:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3996526230055649001.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/CTLFireability68333899240048432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3996526230055649001.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43319e+17,4.16638,94592,2,39605,5,234152,6,0,1292,522405,0


Converting to forward existential form...Done !
original formula: (EX(AX((EG((((p115==0)||(p178==0))||(p367==0))) + EX(((p104==1)||(p24==1)))))) * AX(AG((p43==1))))
=> equivalent forward existential formula: ([(Init * !(EX(!(EX(!((EG((((p115==0)||(p178==0))||(p367==0))) + EX(((p104==1)||(p24==1))))))))))] = FALSE * [(F...198
(forward)formula 0,0,6.25659,103272,1,0,11,273181,10,2,2596,596457,4
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 285 transition count 238
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 285 transition count 237
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 76 place count 272 transition count 224
Iterating global reduction 1 with 13 rules applied. Total rules applied 89 place count 272 transition count 224
Applied a total of 89 rules in 21 ms. Remains 272 /316 variables (removed 44) and now considering 224/269 (removed 45) transitions.
// Phase 1: matrix 224 rows 272 cols
[2024-05-21 23:34:45] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:34:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:34:45] [INFO ] Invariant cache hit.
[2024-05-21 23:34:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2024-05-21 23:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 224/496 variables, 272/363 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 368 constraints, problems are : Problem set: 0 solved, 223 unsolved in 18443 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 41/96 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/379 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/602 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 13/615 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 9/624 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 14/638 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 638 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 88/88 constraints]
After SMT, in 48494ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 48496ms
Starting structural reductions in LTL mode, iteration 1 : 272/316 places, 224/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48941 ms. Remains : 272/316 places, 224/269 transitions.
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:35:34] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:35:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12771455981603953347.gal : 2 ms
[2024-05-21 23:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9026293947126310323.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/CTLFireability12771455981603953347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9026293947126310323.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43061e+17,3.88915,106952,2,42671,5,251460,6,0,1312,597358,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43061e+17,0.181983,9548,1662,29,10518,391,584,19527,41,877,0


Converting to forward existential form...Done !
original formula: E(((E(E(((E((i12.u67.p216==1) U (i14.u55.p166==1)) + (i16.i0.u64.p210==1)) + (i14.u52.p154==1)) U EX((i10.i1.u40.p128==1))) U ((i2.u87.p3...391
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((E(E(((E((i12.u67.p216==1) U (i14.u55.p166==1)) + (i16.i0.u64.p210==1)) + (i14.u52.p154==1)) U...444
Reverse transition relation is NOT exact ! Due to transitions t104, t154, t163, t202, t205, t206, u81.t19, u81.t20, i0.u32.t119, i0.u34.t115, i0.u36.t111, ...920
(forward)formula 0,1,15.277,435908,1,0,757108,482,4144,1.52412e+06,202,1408,840278
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 287 transition count 240
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 287 transition count 239
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 276 transition count 228
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 276 transition count 228
Applied a total of 81 rules in 9 ms. Remains 276 /316 variables (removed 40) and now considering 228/269 (removed 41) transitions.
// Phase 1: matrix 228 rows 276 cols
[2024-05-21 23:36:20] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:36:20] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 23:36:20] [INFO ] Invariant cache hit.
[2024-05-21 23:36:20] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-21 23:36:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:25] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/504 variables, 276/367 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 3 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/504 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (OVERLAPS) 0/504 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 377 constraints, problems are : Problem set: 0 solved, 227 unsolved in 23841 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/504 variables, 276/389 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 227/616 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 17/633 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 9/642 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 652 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 94/94 constraints]
After SMT, in 53896ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 53899ms
Starting structural reductions in LTL mode, iteration 1 : 276/316 places, 228/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54345 ms. Remains : 276/316 places, 228/269 transitions.
[2024-05-21 23:37:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:37:14] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-21 23:37:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10679463272293024781.gal : 2 ms
[2024-05-21 23:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2596175304413593899.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/CTLFireability10679463272293024781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2596175304413593899.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47609e+17,4.85411,123552,2,50856,5,291654,6,0,1332,692363,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47609e+17,0.13465,9344,1665,33,10046,331,592,18202,45,988,0


Converting to forward existential form...Done !
original formula: ((EF(AG(AX((i0.u78.p362==0)))) * A(E((i14.i0.u10.p29==1) U (i7.i0.u87.p317==1)) U (i0.u78.p304!=1))) * (!(A(((((i0.u89.p329==1) + AG((i9....534
=> equivalent forward existential formula: [(EY(((Init * (E(TRUE U !(E(TRUE U !(!(EX(!((i0.u78.p362==0)))))))) * !((E(!((i0.u78.p304!=1)) U (!(E((i14.i0.u1...851
Reverse transition relation is NOT exact ! Due to transitions t107, t157, t161, t166, t206, t209, t210, t213, t219, i0.t12, i0.u78.t3, i0.u78.t18, i0.u80.t...993
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.51771,115208,1,0,217666,331,4118,388174,205,988,454193
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 283 transition count 236
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 283 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 283 transition count 235
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 269 transition count 221
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 269 transition count 221
Applied a total of 95 rules in 17 ms. Remains 269 /316 variables (removed 47) and now considering 221/269 (removed 48) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-21 23:37:48] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 23:37:48] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:37:48] [INFO ] Invariant cache hit.
[2024-05-21 23:37:48] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 23:37:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:37:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 9/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 372 constraints, problems are : Problem set: 0 solved, 220 unsolved in 17040 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 48/103 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/386 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/606 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/623 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:38:31] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 636 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 92/92 constraints]
After SMT, in 47085ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 47088ms
Starting structural reductions in LTL mode, iteration 1 : 269/316 places, 221/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47445 ms. Remains : 269/316 places, 221/269 transitions.
[2024-05-21 23:38:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:35] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 23:38:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8616307533087967657.gal : 1 ms
[2024-05-21 23:38:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3541979327143920568.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/CTLFireability8616307533087967657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3541979327143920568.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43011e+17,3.66793,97924,2,40556,5,237700,6,0,1297,542070,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43011e+17,0.211089,10492,1583,35,12952,634,519,21549,45,1582,0


Converting to forward existential form...Done !
original formula: EF((EF(AX((i16.u57.p176==1))) * AX(((i18.u63.p210==0)&&((i20.i1.u77.p283==1)||(i20.i1.u78.p275==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(TRUE U !(EX(!((i16.u57.p176==1)))))) * !(EX(!(((i18.u63.p210==0)&&((i20.i1.u77.p283==1)||...191
Reverse transition relation is NOT exact ! Due to transitions t101, t151, t155, t160, t199, t201, t202, t203, t212, i0.u39.t104, i0.u41.t100, i1.u31.t120, ...847
(forward)formula 0,1,4.24833,128236,1,0,235159,634,3290,435106,198,1582,385650
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 281 transition count 234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 281 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 281 transition count 233
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 267 transition count 219
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 267 transition count 219
Applied a total of 99 rules in 20 ms. Remains 267 /316 variables (removed 49) and now considering 219/269 (removed 50) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-21 23:39:10] [INFO ] Computed 55 invariants in 5 ms
[2024-05-21 23:39:10] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:39:10] [INFO ] Invariant cache hit.
[2024-05-21 23:39:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:39:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 68 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12291 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:39:49] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:39:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 42340ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42344ms
Starting structural reductions in LTL mode, iteration 1 : 267/316 places, 219/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42667 ms. Remains : 267/316 places, 219/269 transitions.
[2024-05-21 23:39:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:39:53] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-21 23:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:39:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:39:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7667470093683401540.gal : 1 ms
[2024-05-21 23:39:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10413506050479695181.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/CTLFireability7667470093683401540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10413506050479695181.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,3.24333,94624,2,39435,5,233790,6,0,1287,522191,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41012e+17,0.347686,14916,2204,27,19682,321,498,47783,38,725,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(AX((((i8.u29.p90==0)||(i0.u74.p263==0))||(i19.u75.p367==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(EX(!((((i8.u29.p90==0)||(i0.u74.p263==0))||(i19.u75.p367==0))))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t99, t158, t197, t200, t201, t204, t210, i0.u71.t39, i0.u72.t36, i0.u73.t33, i0.u74.t30, i1.u...830
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.04279,75372,1,0,145472,321,3124,274931,181,725,331624
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 282 transition count 235
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 282 transition count 234
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 82 place count 269 transition count 221
Iterating global reduction 1 with 13 rules applied. Total rules applied 95 place count 269 transition count 221
Applied a total of 95 rules in 8 ms. Remains 269 /316 variables (removed 47) and now considering 221/269 (removed 48) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-05-21 23:40:25] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:40:25] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:40:25] [INFO ] Invariant cache hit.
[2024-05-21 23:40:25] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-21 23:40:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/358 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 68 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/490 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/490 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 0/490 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 371 constraints, problems are : Problem set: 0 solved, 220 unsolved in 21295 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 47/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 11/113 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/382 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/602 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 14/616 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 6/623 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 624 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 80/80 constraints]
After SMT, in 51359ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 51361ms
Starting structural reductions in LTL mode, iteration 1 : 269/316 places, 221/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51729 ms. Remains : 269/316 places, 221/269 transitions.
[2024-05-21 23:41:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:16] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-21 23:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16570076897433120955.gal : 2 ms
[2024-05-21 23:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8037167663130923514.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/CTLFireability16570076897433120955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8037167663130923514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41016e+17,4.47912,99980,2,41462,5,243779,6,0,1297,556317,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41016e+17,0.171995,11296,1684,31,14771,494,545,25734,45,1255,0


Converting to forward existential form...Done !
original formula: AG(!(A(EF(AX((i4.u7.p14==1))) U A(((i19.u76.p340==1)||(i4.u8.p17==1)) U EX((i7.u60.p190==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!((E(!(EX((i7.u60.p190==1))) U (!(((i19.u76.p340==1)||(i4.u8.p17==1))) * !(EX((i7.u6...535
Reverse transition relation is NOT exact ! Due to transitions t151, t155, t160, t199, t201, t203, t206, t212, i0.u71.t43, i0.u72.t40, i0.u74.t34, i1.u33.t1...862
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 269/269 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 282 transition count 235
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 282 transition count 234
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 268 transition count 220
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 268 transition count 220
Applied a total of 97 rules in 16 ms. Remains 268 /316 variables (removed 48) and now considering 220/269 (removed 49) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 23:42:17] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:42:17] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 23:42:17] [INFO ] Invariant cache hit.
[2024-05-21 23:42:17] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 23:42:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 4 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 220/488 variables, 268/386 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 5/391 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 391 constraints, problems are : Problem set: 0 solved, 219 unsolved in 18725 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 68/123 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/392 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/611 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:40] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:42:41] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/631 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:46] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:42:52] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 10/641 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:42:56] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:00] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:43:01] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 9/650 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 650 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 108/108 constraints]
After SMT, in 48768ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 48771ms
Starting structural reductions in LTL mode, iteration 1 : 268/316 places, 220/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49135 ms. Remains : 268/316 places, 220/269 transitions.
[2024-05-21 23:43:06] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:43:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:06] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 23:43:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:43:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6540481322583673915.gal : 1 ms
[2024-05-21 23:43:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14975369667033143328.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/CTLFireability6540481322583673915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14975369667033143328.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44274e+17,4.3027,101644,2,41399,5,249449,6,0,1292,560916,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44274e+17,0.236608,11584,1646,26,14664,450,553,24827,38,957,0


Converting to forward existential form...Done !
original formula: EX(AG((!(A((i18.i0.u0.p1==1) U (i6.i1.u71.p250==1))) + ((i15.u52.p156==0)&&(((i0.u37.p118==0)||(i18.i0.u74.p264==0))||(i0.u91.p359==0))))...157
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(!((E(!((i6.i1.u71.p250==1)) U (!((i18.i0.u0.p1==1)) * !((i6.i1.u71.p250==1)))) + EG...281
Reverse transition relation is NOT exact ! Due to transitions t100, t150, t198, t200, t202, t205, t211, i0.u32.t115, i0.u36.t107, i1.u22.t135, i1.u24.t131,...859
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,15.2063,330232,1,0,559688,450,3715,998327,191,957,680699
FORMULA BusinessProcesses-PT-05-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 23:43:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:43:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:43:51] [INFO ] Applying decomposition
[2024-05-21 23:43:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8491928596050721437.txt' '-o' '/tmp/graph8491928596050721437.bin' '-w' '/tmp/graph8491928596050721437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8491928596050721437.bin' '-l' '-1' '-v' '-w' '/tmp/graph8491928596050721437.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:51] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:51] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:43:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9157207403246603753.gal : 2 ms
[2024-05-21 23:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2782658452896279944.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/CTLFireability9157207403246603753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2782658452896279944.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97747e+17,1.69674,53064,6305,52,83476,787,663,172186,57,2988,0


Converting to forward existential form...Done !
original formula: (AG(A((i1.u40.p111==1) U !((AX((i11.u101.p307==1)) + EG((i16.u108.p333==1)))))) * A((i13.i1.u81.p225==1) U A(!(AF((i5.u112.p344==1))) U !...252
=> equivalent forward existential formula: ((([((FwdU(FwdU(Init,TRUE),!(!((!(EX(!((i11.u101.p307==1)))) + EG((i16.u108.p333==1)))))) * !((i1.u40.p111==1)))...2048
Reverse transition relation is NOT exact ! Due to transitions t138, t201, t206, t251, i0.u44.t141, i0.u46.t137, i1.u40.t149, i1.u42.t145, i2.u36.t157, i2.u...1339
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,769.549,3924188,1,0,4.4541e+06,787,2262,1.13977e+07,141,2988,2022781
FORMULA BusinessProcesses-PT-05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG((i7.i0.u54.p148==0)) * !(E(((i0.u45.p125==1)||(i16.u96.p278==1)) U (A(EX((i17.i1.u103.p316==1)) U A((i17.i0.u24.p69==1) U (i16.u108.p...189
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i7.i0.u54.p148==0)))] = FALSE * ([((FwdU(Init,((i0.u45.p125==1)||(i16.u96.p278==1))) * !...636
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-22 00:10:50] [INFO ] Applying decomposition
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:10:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:10:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:10:50] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-22 00:10:50] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:10:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:10:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9243215507112240196.gal : 6 ms
[2024-05-22 00:10:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14940952291883046165.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/CTLFireability9243215507112240196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14940952291883046165.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97747e+17,84.0483,1844504,53710,1483,832897,3666,766,2.29073e+07,399,33519,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-22 00:19:24] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:19:24] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-22 00:19:24] [INFO ] Transformed 316 places.
[2024-05-22 00:19:24] [INFO ] Transformed 269 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:19:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14683951500311188760.gal : 2 ms
[2024-05-22 00:19:24] [INFO ] Time to serialize properties into /tmp/CTLFireability15143378604299905968.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/CTLFireability14683951500311188760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15143378604299905968.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r048-tajo-171620399600482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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