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-171620399700514.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-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 104K 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-09-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716334335934

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:32:17] [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:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:32:17] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 23:32:17] [INFO ] Transformed 403 places.
[2024-05-21 23:32:17] [INFO ] Transformed 374 transitions.
[2024-05-21 23:32:17] [INFO ] Found NUPN structural information;
[2024-05-21 23:32:17] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 134 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 371 transition count 343
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 371 transition count 343
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 362 transition count 334
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 362 transition count 334
Applied a total of 81 rules in 83 ms. Remains 362 /403 variables (removed 41) and now considering 334/374 (removed 40) transitions.
// Phase 1: matrix 334 rows 362 cols
[2024-05-21 23:32:17] [INFO ] Computed 64 invariants in 27 ms
[2024-05-21 23:32:17] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-21 23:32:17] [INFO ] Invariant cache hit.
[2024-05-21 23:32:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-05-21 23:32:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 20 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 7 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 5 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:32:30] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 20/184 constraints. Problems are: Problem set: 6 solved, 327 unsolved
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 6 solved, 327 unsolved
Search for dead transitions found 6 dead transitions in 30229ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 362/403 places, 328/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 362 /362 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31008 ms. Remains : 362/403 places, 328/374 transitions.
Support contains 134 out of 362 places after structural reductions.
[2024-05-21 23:32:48] [INFO ] Flatten gal took : 88 ms
[2024-05-21 23:32:48] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:32:48] [INFO ] Input system was already deterministic with 328 transitions.
Support contains 132 out of 362 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (422 resets) in 1741 ms. (22 steps per ms) remains 20/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
// Phase 1: matrix 328 rows 362 cols
[2024-05-21 23:32:49] [INFO ] Computed 64 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (OVERLAPS) 146/190 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 86/276 variables, 19/34 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 5 (OVERLAPS) 83/359 variables, 30/64 constraints. Problems are: Problem set: 4 solved, 16 unsolved
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 12 places in 1291 ms of which 8 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 5 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 2 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 2 ms to minimize.
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 3 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 20/84 constraints. Problems are: Problem set: 4 solved, 16 unsolved
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 5130ms, After SMT, problems are : Problem set: 4 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 328/328 transitions.
Graph (trivial) has 168 edges and 362 vertex of which 7 / 362 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 780 edges and 356 vertex of which 355 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 355 transition count 269
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 305 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 303 transition count 267
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 106 place count 303 transition count 210
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 227 place count 239 transition count 210
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 250 place count 216 transition count 187
Iterating global reduction 3 with 23 rules applied. Total rules applied 273 place count 216 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 273 place count 216 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 215 transition count 186
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 125 rules applied. Total rules applied 400 place count 151 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 150 transition count 128
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 404 place count 150 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 406 place count 148 transition count 126
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 411 place count 148 transition count 126
Applied a total of 411 rules in 103 ms. Remains 148 /362 variables (removed 214) and now considering 126/328 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 148/362 places, 126/328 transitions.
RANDOM walk for 40000 steps (1524 resets) in 489 ms. (81 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40003 steps (450 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (446 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (623 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (439 resets) in 245 ms. (162 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (611 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (478 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (458 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
// Phase 1: matrix 126 rows 148 cols
[2024-05-21 23:32:55] [INFO ] Computed 54 invariants in 13 ms
[2024-05-21 23:32:55] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 42/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 56/112 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 34/146 variables, 18/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
Problem AtomicPropp28 is UNSAT
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
Problem AtomicPropp32 is UNSAT
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
Problem AtomicPropp40 is UNSAT
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 18/71 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/72 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/72 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 126/273 variables, 147/219 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 11/230 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/230 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp90 is UNSAT
At refinement iteration 13 (OVERLAPS) 1/274 variables, 1/231 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/231 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/274 variables, 0/231 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 231 constraints, problems are : Problem set: 6 solved, 1 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 148/148 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/106 variables, 33/35 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/37 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/145 variables, 17/54 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 14/68 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
Problem AtomicPropp68 is UNSAT
After SMT solving in domain Int declared 145/274 variables, and 70 constraints, problems are : Problem set: 7 solved, 0 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 17/19 constraints, State Equation: 0/148 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 18/22 constraints]
After SMT, in 1623ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:32:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:32:57] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:32:57] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:32:57] [INFO ] Input system was already deterministic with 328 transitions.
Computed a total of 222 stabilizing places and 218 stable transitions
Graph (complete) has 788 edges and 362 vertex of which 361 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 22 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
// Phase 1: matrix 283 rows 317 cols
[2024-05-21 23:32:57] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:32:57] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-21 23:32:57] [INFO ] Invariant cache hit.
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-21 23:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:33:05] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 278 unsolved
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 268 unsolved
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 5 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 27 solved, 255 unsolved
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:14] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:33:15] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 5 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:20] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
Problem TDEAD242 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 253 unsolved
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:22] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:33:23] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:33:23] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/217 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/600 variables, and 223 constraints, problems are : Problem set: 30 solved, 252 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 30 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 28/28 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 34/62 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 159/223 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 7/230 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/235 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 5/240 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 6/246 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 4/250 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 3/253 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 9/262 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 4/266 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/269 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 6/275 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 2/277 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:33:56] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/317 variables, 4/281 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/600 variables, and 282 constraints, problems are : Problem set: 30 solved, 252 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/282 constraints, Known Traps: 218/218 constraints]
After SMT, in 60094ms problems are : Problem set: 30 solved, 252 unsolved
Search for dead transitions found 30 dead transitions in 60101ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/362 places, 253/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 314 transition count 253
Applied a total of 3 rules in 6 ms. Remains 314 /317 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 314 cols
[2024-05-21 23:33:58] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:33:58] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 23:33:58] [INFO ] Invariant cache hit.
[2024-05-21 23:33:58] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/362 places, 253/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61306 ms. Remains : 314/362 places, 253/328 transitions.
[2024-05-21 23:33:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:33:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:33:58] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:33:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:33:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:33:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15280181130801015937.gal : 6 ms
[2024-05-21 23:33:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7726994079619657339.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15280181130801015937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7726994079619657339.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:34:29] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:34:29] [INFO ] Applying decomposition
[2024-05-21 23:34:29] [INFO ] Flatten gal took : 18 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/graph9557161505318574193.txt' '-o' '/tmp/graph9557161505318574193.bin' '-w' '/tmp/graph9557161505318574193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9557161505318574193.bin' '-l' '-1' '-v' '-w' '/tmp/graph9557161505318574193.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:34:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:34:29] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-21 23:34:29] [INFO ] Flatten gal took : 120 ms
[2024-05-21 23:34:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 20 ms.
[2024-05-21 23:34:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8601090304467919221.gal : 22 ms
[2024-05-21 23:34:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14695980750828900244.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/CTLFireability8601090304467919221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14695980750828900244.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,3.95625e+18,10.439,210684,16488,56,349642,956,667,718320,74,1934,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Graph (trivial) has 185 edges and 362 vertex of which 7 / 362 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 781 edges and 356 vertex of which 355 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 354 transition count 264
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 299 transition count 264
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 112 place count 299 transition count 199
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 251 place count 225 transition count 199
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 279 place count 197 transition count 171
Iterating global reduction 2 with 28 rules applied. Total rules applied 307 place count 197 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 307 place count 197 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 313 place count 194 transition count 168
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 452 place count 123 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 122 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 121 transition count 99
Applied a total of 454 rules in 64 ms. Remains 121 /362 variables (removed 241) and now considering 99/328 (removed 229) transitions.
// Phase 1: matrix 99 rows 121 cols
[2024-05-21 23:34:59] [INFO ] Computed 51 invariants in 1 ms
[2024-05-21 23:34:59] [INFO ] Implicit Places using invariants in 196 ms returned [0, 1, 2, 10, 11, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 197 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/362 places, 99/328 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 266 ms. Remains : 110/362 places, 99/328 transitions.
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:34:59] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 668 steps (137 resets) in 28 ms. (23 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:34:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1050162427553556165.gal : 2 ms
[2024-05-21 23:34:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4306566590816217835.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/ReachabilityCardinality1050162427553556165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4306566590816217835.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 10 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
// Phase 1: matrix 286 rows 320 cols
[2024-05-21 23:34:59] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:35:00] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-21 23:35:00] [INFO ] Invariant cache hit.
[2024-05-21 23:35:00] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-21 23:35:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 4 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 9 solved, 276 unsolved
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 19 solved, 266 unsolved
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 21 solved, 264 unsolved
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 29 solved, 256 unsolved
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 15 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:19] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 29 solved, 256 unsolved
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 256 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
Problem TDEAD228 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 20/224 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:29] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 20/244 constraints. Problems are: Problem set: 30 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/606 variables, and 244 constraints, problems are : Problem set: 30 solved, 255 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 30 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 180/244 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/264 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/284 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:35:40] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:35:41] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 17/301 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 6/307 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:48] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:48] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:35:48] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:35:50] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/327 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:35:52] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:52] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:35:52] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 4 ms to minimize.
[2024-05-21 23:35:52] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:35:54] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 14/341 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:55] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 3/344 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:58] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 1 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:35:59] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:36:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:36:01] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 30 solved, 255 unsolved
Search for dead transitions found 30 dead transitions in 60140ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/362 places, 256/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 256
Applied a total of 3 rules in 11 ms. Remains 317 /320 variables (removed 3) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 317 cols
[2024-05-21 23:36:01] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:36:01] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 23:36:01] [INFO ] Invariant cache hit.
[2024-05-21 23:36:01] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 317/362 places, 256/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61732 ms. Remains : 317/362 places, 256/328 transitions.
[2024-05-21 23:36:01] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:36:01] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:36:01] [INFO ] Input system was already deterministic with 256 transitions.
[2024-05-21 23:36:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:36:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:36:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15100854115110832723.gal : 16 ms
[2024-05-21 23:36:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8662621891058572094.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15100854115110832723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8662621891058572094.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:36:31] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:36:31] [INFO ] Applying decomposition
[2024-05-21 23:36:31] [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/graph399604609550190490.txt' '-o' '/tmp/graph399604609550190490.bin' '-w' '/tmp/graph399604609550190490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph399604609550190490.bin' '-l' '-1' '-v' '-w' '/tmp/graph399604609550190490.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:31] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-21 23:36:31] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:36:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:36:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2053913561557348203.gal : 5 ms
[2024-05-21 23:36:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11291920383856354257.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/CTLFireability2053913561557348203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11291920383856354257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06243e+18,1.42162,44116,3969,27,76878,439,640,111245,49,1149,0


Converting to forward existential form...Done !
original formula: EG((AG(EF((i19.u22.p60==0))) + ((AX((i20.u90.p315==0)) * (i20.u83.p305==0)) * ((i10.u99.p361==1)||((i4.u30.p96==1)&&(i4.u94.p340==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U (i19.u22.p60==0))))) + ((!(EX(!((i20.u90.p315==0)))) * (i20.u83.p305==0)) * ((...222
Reverse transition relation is NOT exact ! Due to transitions t7, t138, t156, t164, t168, t180, t184, t211, t215, t236, t237, t247, t248, t251, i0.u9.t187,...840
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,7.75474,235516,1,0,517444,491,4931,666798,276,1481,1235201
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-03 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 : 362/362 places, 328/328 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 329 transition count 295
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 329 transition count 295
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 318 transition count 284
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 318 transition count 284
Applied a total of 88 rules in 11 ms. Remains 318 /362 variables (removed 44) and now considering 284/328 (removed 44) transitions.
// Phase 1: matrix 284 rows 318 cols
[2024-05-21 23:36:39] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:36:39] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-21 23:36:39] [INFO ] Invariant cache hit.
[2024-05-21 23:36:40] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-21 23:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/318 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 20/84 constraints. Problems are: Problem set: 6 solved, 277 unsolved
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 4 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 20/104 constraints. Problems are: Problem set: 16 solved, 267 unsolved
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 20/124 constraints. Problems are: Problem set: 28 solved, 255 unsolved
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 20/144 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 20/164 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 20/184 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/602 variables, and 223 constraints, problems are : Problem set: 30 solved, 253 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/318 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 30 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 28/28 constraints. Problems are: Problem set: 30 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/28 constraints. Problems are: Problem set: 30 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/318 variables, 34/62 constraints. Problems are: Problem set: 30 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 159/223 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:15] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 20/243 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:16] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 20/263 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:37:22] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 12/275 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:37:24] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 12/287 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:37:28] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:37:29] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:37:30] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 20/307 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:37:32] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 5/312 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:34] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 8/320 constraints. Problems are: Problem set: 30 solved, 253 unsolved
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)timeout

(s222 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/602 variables, and 334 constraints, problems are : Problem set: 30 solved, 253 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/318 constraints, PredecessorRefiner: 0/283 constraints, Known Traps: 270/270 constraints]
After SMT, in 60101ms problems are : Problem set: 30 solved, 253 unsolved
Search for dead transitions found 30 dead transitions in 60106ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 318/362 places, 254/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 315 transition count 254
Applied a total of 3 rules in 6 ms. Remains 315 /318 variables (removed 3) and now considering 254/254 (removed 0) transitions.
// Phase 1: matrix 254 rows 315 cols
[2024-05-21 23:37:40] [INFO ] Computed 70 invariants in 6 ms
[2024-05-21 23:37:40] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 23:37:40] [INFO ] Invariant cache hit.
[2024-05-21 23:37:40] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 315/362 places, 254/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61241 ms. Remains : 315/362 places, 254/328 transitions.
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:37:41] [INFO ] Input system was already deterministic with 254 transitions.
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:37:41] [INFO ] Time to serialize gal into /tmp/CTLFireability18063774929675622818.gal : 4 ms
[2024-05-21 23:37:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5331793731504539071.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/CTLFireability18063774929675622818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5331793731504539071.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:38:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:38:11] [INFO ] Applying decomposition
[2024-05-21 23:38:11] [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/graph13261247897181642499.txt' '-o' '/tmp/graph13261247897181642499.bin' '-w' '/tmp/graph13261247897181642499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13261247897181642499.bin' '-l' '-1' '-v' '-w' '/tmp/graph13261247897181642499.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:11] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:11] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:38:11] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:38:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12893633864275289313.gal : 5 ms
[2024-05-21 23:38:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6566481306428689312.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/CTLFireability12893633864275289313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6566481306428689312.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.11743e+18,25.5956,508924,61552,47,909036,603,662,1.59755e+06,63,1372,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 331 transition count 297
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 331 transition count 297
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 320 transition count 286
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 16 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
// Phase 1: matrix 286 rows 320 cols
[2024-05-21 23:38:41] [INFO ] Computed 64 invariants in 6 ms
[2024-05-21 23:38:41] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 23:38:41] [INFO ] Invariant cache hit.
[2024-05-21 23:38:42] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-21 23:38:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 9 solved, 276 unsolved
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 21 solved, 264 unsolved
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:38:53] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 26 solved, 259 unsolved
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/204 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:39:09] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 20/224 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/606 variables, and 227 constraints, problems are : Problem set: 30 solved, 255 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/320 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 163/163 constraints]
Escalating to Integer solving :Problem set: 30 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 163/227 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 12/239 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 17/256 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 4/260 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 6/266 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/267 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/269 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/269 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 12 (OVERLAPS) 286/606 variables, 320/589 constraints. Problems are: Problem set: 30 solved, 255 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/606 variables, 255/844 constraints. Problems are: Problem set: 30 solved, 255 unsolved
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:39:41] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 857 constraints, problems are : Problem set: 30 solved, 255 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 255/285 constraints, Known Traps: 218/218 constraints]
After SMT, in 60078ms problems are : Problem set: 30 solved, 255 unsolved
Search for dead transitions found 30 dead transitions in 60083ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/362 places, 256/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 256
Applied a total of 3 rules in 5 ms. Remains 317 /320 variables (removed 3) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 317 cols
[2024-05-21 23:39:42] [INFO ] Computed 70 invariants in 4 ms
[2024-05-21 23:39:42] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 23:39:42] [INFO ] Invariant cache hit.
[2024-05-21 23:39:42] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 317/362 places, 256/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61140 ms. Remains : 317/362 places, 256/328 transitions.
[2024-05-21 23:39:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:42] [INFO ] Input system was already deterministic with 256 transitions.
[2024-05-21 23:39:42] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:39:42] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:39:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13608441747084669644.gal : 3 ms
[2024-05-21 23:39:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7030153074036948262.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/CTLFireability13608441747084669644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7030153074036948262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:40:12] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:40:12] [INFO ] Applying decomposition
[2024-05-21 23:40:12] [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/graph13257027588357757314.txt' '-o' '/tmp/graph13257027588357757314.bin' '-w' '/tmp/graph13257027588357757314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13257027588357757314.bin' '-l' '-1' '-v' '-w' '/tmp/graph13257027588357757314.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:12] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:12] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 23:40:12] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:40:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:40:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13819584481027164537.gal : 3 ms
[2024-05-21 23:40:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9008300041700513718.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/CTLFireability13819584481027164537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9008300041700513718.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.02875e+18,2.74272,63480,3744,30,109890,367,707,190940,49,855,0


Converting to forward existential form...Done !
original formula: EF((((E((i18.u30.p97==1) U (i0.u3.p7==1)) * EF((((i17.i0.u28.p105==1)&&(i15.u81.p265==1))&&(i17.i1.u93.p382==1)))) * ((i11.u71.p217!=1) *...365
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * ((E((i18.u30.p97==1) U (i0.u3.p7==1)) * E(TRUE U (((i17.i0.u28.p105==1)&&(i15.u81.p2...1011
Reverse transition relation is NOT exact ! Due to transitions t7, t114, t138, t156, t164, t168, t174, t184, t211, t215, t236, t237, t239, t246, t247, t248,...883
(forward)formula 0,1,7.34478,168288,1,0,347202,378,5013,523362,241,1157,746810
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 334 transition count 300
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 334 transition count 300
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 326 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 326 transition count 292
Applied a total of 72 rules in 21 ms. Remains 326 /362 variables (removed 36) and now considering 292/328 (removed 36) transitions.
// Phase 1: matrix 292 rows 326 cols
[2024-05-21 23:40:20] [INFO ] Computed 64 invariants in 1 ms
[2024-05-21 23:40:20] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:40:20] [INFO ] Invariant cache hit.
[2024-05-21 23:40:20] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-21 23:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 20/84 constraints. Problems are: Problem set: 8 solved, 283 unsolved
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 20/104 constraints. Problems are: Problem set: 8 solved, 283 unsolved
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 7 ms to minimize.
[2024-05-21 23:40:32] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 277 unsolved
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 20/144 constraints. Problems are: Problem set: 19 solved, 272 unsolved
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 20/164 constraints. Problems are: Problem set: 29 solved, 262 unsolved
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 20/184 constraints. Problems are: Problem set: 29 solved, 262 unsolved
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 262 unsolved
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 20/224 constraints. Problems are: Problem set: 30 solved, 261 unsolved
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
SMT process timed out in 30065ms, After SMT, problems are : Problem set: 30 solved, 261 unsolved
Search for dead transitions found 30 dead transitions in 30068ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 326/362 places, 262/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 323 transition count 262
Applied a total of 3 rules in 5 ms. Remains 323 /326 variables (removed 3) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 323 cols
[2024-05-21 23:40:50] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:40:50] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:40:50] [INFO ] Invariant cache hit.
[2024-05-21 23:40:51] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 323/362 places, 262/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31012 ms. Remains : 323/362 places, 262/328 transitions.
[2024-05-21 23:40:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:40:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:40:51] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-21 23:40:51] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:40:51] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:40:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2022049203513614528.gal : 2 ms
[2024-05-21 23:40:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11244215480149888600.ctl : 11 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/CTLFireability2022049203513614528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11244215480149888600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:41:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:41:21] [INFO ] Applying decomposition
[2024-05-21 23:41:21] [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/graph12024671840045765691.txt' '-o' '/tmp/graph12024671840045765691.bin' '-w' '/tmp/graph12024671840045765691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12024671840045765691.bin' '-l' '-1' '-v' '-w' '/tmp/graph12024671840045765691.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:21] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:41:21] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:41:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:41:21] [INFO ] Time to serialize gal into /tmp/CTLFireability15180200094796717420.gal : 4 ms
[2024-05-21 23:41:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11789320977836064192.ctl : 14 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/CTLFireability15180200094796717420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11789320977836064192.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.5705e+18,4.58735,129276,4557,58,243004,1021,730,440616,75,2343,0


Converting to forward existential form...Done !
original formula: E((AG(AX((i11.i1.u72.p213==1))) + ((!(((i15.u109.p386==1)&&(i15.u110.p389==1))) * (!(((i13.u65.p186==1) * AG((i15.u101.p362==1)))) + (i6....447
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(EX(!((i11.i1.u72.p213==1))))))) + ((!(((i15.u109.p386==1)&&(i15.u110.p389==1))) * (!...761
Reverse transition relation is NOT exact ! Due to transitions t7, t115, t139, t160, t170, t174, t186, t190, t217, t221, t245, t252, t253, t254, t257, i0.u4...927
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 332 transition count 298
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 332 transition count 298
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 322 transition count 288
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 322 transition count 288
Applied a total of 80 rules in 24 ms. Remains 322 /362 variables (removed 40) and now considering 288/328 (removed 40) transitions.
// Phase 1: matrix 288 rows 322 cols
[2024-05-21 23:41:51] [INFO ] Computed 64 invariants in 2 ms
[2024-05-21 23:41:51] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 23:41:51] [INFO ] Invariant cache hit.
[2024-05-21 23:41:52] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-21 23:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/84 constraints. Problems are: Problem set: 6 solved, 281 unsolved
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:00] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/104 constraints. Problems are: Problem set: 19 solved, 268 unsolved
[2024-05-21 23:42:01] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:42:02] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/124 constraints. Problems are: Problem set: 25 solved, 262 unsolved
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 20/144 constraints. Problems are: Problem set: 25 solved, 262 unsolved
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:42:12] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 20/164 constraints. Problems are: Problem set: 25 solved, 262 unsolved
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 20/184 constraints. Problems are: Problem set: 25 solved, 262 unsolved
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 5 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 62 places in 715 ms of which 3 ms to minimize.
SMT process timed out in 30155ms, After SMT, problems are : Problem set: 25 solved, 262 unsolved
Search for dead transitions found 25 dead transitions in 30159ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 322/362 places, 263/328 transitions.
Applied a total of 0 rules in 5 ms. Remains 322 /322 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30655 ms. Remains : 322/362 places, 263/328 transitions.
[2024-05-21 23:42:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:22] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:42:22] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 23:42:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:22] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:42:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17479272699052049896.gal : 1 ms
[2024-05-21 23:42:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16501406679831400672.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/CTLFireability17479272699052049896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16501406679831400672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:42:52] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:42:52] [INFO ] Applying decomposition
[2024-05-21 23:42:52] [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/graph7422069255020981383.txt' '-o' '/tmp/graph7422069255020981383.bin' '-w' '/tmp/graph7422069255020981383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7422069255020981383.bin' '-l' '-1' '-v' '-w' '/tmp/graph7422069255020981383.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:52] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:52] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-21 23:42:52] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:42:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:42:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7751084753184964026.gal : 4 ms
[2024-05-21 23:42:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14670024105151143780.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/CTLFireability7751084753184964026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14670024105151143780.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 21 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
// Phase 1: matrix 283 rows 317 cols
[2024-05-21 23:43:22] [INFO ] Computed 64 invariants in 2 ms
[2024-05-21 23:43:22] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 23:43:22] [INFO ] Invariant cache hit.
[2024-05-21 23:43:23] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-21 23:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 4 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 77 places in 450 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 278 unsolved
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:43:34] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 268 unsolved
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 27 solved, 255 unsolved
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:43:42] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:44] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
Problem TDEAD242 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 253 unsolved
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:47] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:48] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:49] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-05-21 23:43:50] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/217 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 6/223 constraints. Problems are: Problem set: 30 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/600 variables, and 223 constraints, problems are : Problem set: 30 solved, 252 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 159/159 constraints]
Escalating to Integer solving :Problem set: 30 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 28/28 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 34/62 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 30 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 159/223 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 7/230 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 5/235 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 5/240 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:44:02] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 6/246 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 4/250 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 3/253 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 9/262 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 4/266 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:14] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 3/269 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 6/275 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/317 variables, 2/277 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/600 variables, and 281 constraints, problems are : Problem set: 30 solved, 252 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/282 constraints, Known Traps: 217/217 constraints]
After SMT, in 60106ms problems are : Problem set: 30 solved, 252 unsolved
Search for dead transitions found 30 dead transitions in 60113ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/362 places, 253/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 314 transition count 253
Applied a total of 3 rules in 4 ms. Remains 314 /317 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 314 cols
[2024-05-21 23:44:23] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:44:23] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:44:23] [INFO ] Invariant cache hit.
[2024-05-21 23:44:23] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/362 places, 253/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61261 ms. Remains : 314/362 places, 253/328 transitions.
[2024-05-21 23:44:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:44:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:44:23] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:44:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:44:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:44:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14449804523045945749.gal : 2 ms
[2024-05-21 23:44:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2122734491180100042.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/CTLFireability14449804523045945749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2122734491180100042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:44:54] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:44:54] [INFO ] Applying decomposition
[2024-05-21 23:44:54] [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/graph11716318492440490693.txt' '-o' '/tmp/graph11716318492440490693.bin' '-w' '/tmp/graph11716318492440490693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11716318492440490693.bin' '-l' '-1' '-v' '-w' '/tmp/graph11716318492440490693.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:54] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:54] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-21 23:44:54] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability926386661470732099.gal : 4 ms
[2024-05-21 23:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6476955543979475131.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/CTLFireability926386661470732099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6476955543979475131.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95625e+18,4.17247,92928,5737,29,177797,472,653,265842,53,1106,0


Converting to forward existential form...Done !
original formula: (EF((i8.u33.p101==1)) * AG(AX(AF(EX(TRUE)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (i8.u33.p101==1))))] = FALSE * [FwdG(EY(FwdU(Init,TRUE)),!(EX(TRUE)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t111, t135, t153, t165, t171, t181, t208, t212, t233, t236, t243, t244, t245, t248, i0.u4...828
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,13.8241,268488,1,0,537541,472,3729,906080,230,1106,1066695
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 8 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
// Phase 1: matrix 286 rows 320 cols
[2024-05-21 23:45:08] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:45:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:45:08] [INFO ] Invariant cache hit.
[2024-05-21 23:45:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-21 23:45:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 2 solved, 283 unsolved
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 2 solved, 283 unsolved
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 13 solved, 272 unsolved
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 5 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 18 solved, 267 unsolved
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:45:26] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 26 solved, 259 unsolved
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/204 constraints. Problems are: Problem set: 26 solved, 259 unsolved
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:45:35] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 20/224 constraints. Problems are: Problem set: 29 solved, 256 unsolved
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 16 ms to minimize.
SMT process timed out in 30059ms, After SMT, problems are : Problem set: 29 solved, 256 unsolved
Search for dead transitions found 29 dead transitions in 30062ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/362 places, 257/328 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 318 transition count 257
Applied a total of 2 rules in 8 ms. Remains 318 /320 variables (removed 2) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 318 cols
[2024-05-21 23:45:38] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:45:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 23:45:38] [INFO ] Invariant cache hit.
[2024-05-21 23:45:38] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 317/362 places, 257/328 transitions.
Applied a total of 0 rules in 3 ms. Remains 317 /317 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 30832 ms. Remains : 317/362 places, 257/328 transitions.
[2024-05-21 23:45:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:45:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:45:38] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-21 23:45:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:45:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14215205939017056392.gal : 1 ms
[2024-05-21 23:45:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13977659875879043681.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/CTLFireability14215205939017056392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13977659875879043681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:46:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:46:09] [INFO ] Applying decomposition
[2024-05-21 23:46:09] [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/graph15366268234638573736.txt' '-o' '/tmp/graph15366268234638573736.bin' '-w' '/tmp/graph15366268234638573736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15366268234638573736.bin' '-l' '-1' '-v' '-w' '/tmp/graph15366268234638573736.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:09] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:09] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-21 23:46:09] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:46:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:46:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7509271004753634232.gal : 4 ms
[2024-05-21 23:46:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11817123067205008958.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7509271004753634232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11817123067205008958.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 328 transition count 294
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 328 transition count 294
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 317 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 317 transition count 283
Applied a total of 90 rules in 35 ms. Remains 317 /362 variables (removed 45) and now considering 283/328 (removed 45) transitions.
// Phase 1: matrix 283 rows 317 cols
[2024-05-21 23:46:39] [INFO ] Computed 64 invariants in 5 ms
[2024-05-21 23:46:39] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-21 23:46:39] [INFO ] Invariant cache hit.
[2024-05-21 23:46:40] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-21 23:46:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/317 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:46:45] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:46] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 20/104 constraints. Problems are: Problem set: 4 solved, 278 unsolved
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:46:49] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 268 unsolved
[2024-05-21 23:46:50] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:46:52] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 3 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 20/144 constraints. Problems are: Problem set: 27 solved, 255 unsolved
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:54] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:46:55] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
Problem TDEAD257 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:46:56] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 96 places in 258 ms of which 3 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 5 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:00] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 20/184 constraints. Problems are: Problem set: 28 solved, 254 unsolved
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:47:03] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
Problem TDEAD242 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 253 unsolved
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:47:04] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:47:05] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-05-21 23:47:06] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/217 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:47:07] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:47:08] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 6/223 constraints. Problems are: Problem set: 30 solved, 252 unsolved
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 30 solved, 252 unsolved
Search for dead transitions found 30 dead transitions in 30154ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 317/362 places, 253/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 314 transition count 253
Applied a total of 3 rules in 4 ms. Remains 314 /317 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 314 cols
[2024-05-21 23:47:10] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:47:10] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 23:47:10] [INFO ] Invariant cache hit.
[2024-05-21 23:47:10] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 314/362 places, 253/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31451 ms. Remains : 314/362 places, 253/328 transitions.
[2024-05-21 23:47:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:10] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:47:10] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:47:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9249000543687033467.gal : 1 ms
[2024-05-21 23:47:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4634841601574545424.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/CTLFireability9249000543687033467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4634841601574545424.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:40] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:47:40] [INFO ] Applying decomposition
[2024-05-21 23:47:40] [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/graph10770582572985800221.txt' '-o' '/tmp/graph10770582572985800221.bin' '-w' '/tmp/graph10770582572985800221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10770582572985800221.bin' '-l' '-1' '-v' '-w' '/tmp/graph10770582572985800221.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:40] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:40] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:47:40] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:47:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:47:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10892511988301537504.gal : 7 ms
[2024-05-21 23:47:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10974253954535916207.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/CTLFireability10892511988301537504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10974253954535916207.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,3.95625e+18,8.26112,160588,4610,40,250673,559,677,742743,60,1367,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(AX(AG((i8.u43.p125==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(EX(!(!(E(TRUE U !((i8.u43.p125==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t135, t153, t161, t165, t171, t181, t208, t212, t233, t234, t236, t243, t244, t245, t248,...856
(forward)formula 0,0,15.1492,204676,1,0,344029,680,4054,998021,296,1452,669891
FORMULA BusinessProcesses-PT-09-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 15 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
// Phase 1: matrix 286 rows 320 cols
[2024-05-21 23:47:56] [INFO ] Computed 64 invariants in 4 ms
[2024-05-21 23:47:56] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 23:47:56] [INFO ] Invariant cache hit.
[2024-05-21 23:47:56] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-21 23:47:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 3 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:48:05] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:06] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
Problem TDEAD252 is UNSAT
Problem TDEAD260 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 2 solved, 283 unsolved
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:48:10] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 9 solved, 276 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 15 solved, 270 unsolved
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
Problem TDEAD227 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 16 solved, 269 unsolved
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/204 constraints. Problems are: Problem set: 16 solved, 269 unsolved
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 20/224 constraints. Problems are: Problem set: 17 solved, 268 unsolved
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 30081ms, After SMT, problems are : Problem set: 17 solved, 268 unsolved
Search for dead transitions found 17 dead transitions in 30085ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/362 places, 269/328 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30641 ms. Remains : 320/362 places, 269/328 transitions.
[2024-05-21 23:48:26] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:48:26] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:48:26] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-21 23:48:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11420131787070265846.gal : 2 ms
[2024-05-21 23:48:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11897610295777882977.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/CTLFireability11420131787070265846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11897610295777882977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:48:56] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:48:56] [INFO ] Applying decomposition
[2024-05-21 23:48:56] [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/graph4786017984676569934.txt' '-o' '/tmp/graph4786017984676569934.bin' '-w' '/tmp/graph4786017984676569934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4786017984676569934.bin' '-l' '-1' '-v' '-w' '/tmp/graph4786017984676569934.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:56] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:56] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-21 23:48:56] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:48:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:48:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17677882930032938172.gal : 4 ms
[2024-05-21 23:48:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15374596650981593513.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/CTLFireability17677882930032938172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15374596650981593513.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 320 transition count 286
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 320 transition count 286
Applied a total of 84 rules in 17 ms. Remains 320 /362 variables (removed 42) and now considering 286/328 (removed 42) transitions.
// Phase 1: matrix 286 rows 320 cols
[2024-05-21 23:49:27] [INFO ] Computed 64 invariants in 2 ms
[2024-05-21 23:49:27] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 23:49:27] [INFO ] Invariant cache hit.
[2024-05-21 23:49:27] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-21 23:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 20/104 constraints. Problems are: Problem set: 17 solved, 268 unsolved
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:36] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:49:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/124 constraints. Problems are: Problem set: 17 solved, 268 unsolved
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 20/144 constraints. Problems are: Problem set: 25 solved, 260 unsolved
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/164 constraints. Problems are: Problem set: 28 solved, 257 unsolved
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:49:44] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:49:46] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 20/184 constraints. Problems are: Problem set: 28 solved, 257 unsolved
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:49:49] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:49:50] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:49:51] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 4 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
Problem TDEAD236 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 20/204 constraints. Problems are: Problem set: 29 solved, 256 unsolved
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:53] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:49:56] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
[2024-05-21 23:49:57] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 29 solved, 256 unsolved
Search for dead transitions found 30 dead transitions in 30094ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/362 places, 256/328 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 256
Applied a total of 3 rules in 5 ms. Remains 317 /320 variables (removed 3) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 317 cols
[2024-05-21 23:49:57] [INFO ] Computed 70 invariants in 3 ms
[2024-05-21 23:49:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 23:49:57] [INFO ] Invariant cache hit.
[2024-05-21 23:49:58] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 317/362 places, 256/328 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31064 ms. Remains : 317/362 places, 256/328 transitions.
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:58] [INFO ] Input system was already deterministic with 256 transitions.
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:49:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13691837411226614366.gal : 3 ms
[2024-05-21 23:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6110095250831414139.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/CTLFireability13691837411226614366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6110095250831414139.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:50:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:50:28] [INFO ] Applying decomposition
[2024-05-21 23:50:28] [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/graph8836230750005004423.txt' '-o' '/tmp/graph8836230750005004423.bin' '-w' '/tmp/graph8836230750005004423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8836230750005004423.bin' '-l' '-1' '-v' '-w' '/tmp/graph8836230750005004423.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:28] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:50:28] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:50:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14444461507194792067.gal : 4 ms
[2024-05-21 23:50:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7045120484321367334.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/CTLFireability14444461507194792067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7045120484321367334.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.25259e+18,1.64923,50768,3583,39,81263,579,679,178682,65,1242,0


Converting to forward existential form...Done !
original formula: E(AG(!((EG((i17.u94.p342==1)) + (i8.u26.p72==1)))) U EG((EG((AX((((i10.i0.u28.p105==1)&&(i13.u80.p265==1))&&(i10.i1.u90.p382==1))) + AG((...245
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(E(TRUE U !(!((EG((i17.u94.p342==1)) + (i8.u26.p72==1))))))),(EG((!(EX(!((((i10.i0.u28.p105==1)...319
Reverse transition relation is NOT exact ! Due to transitions t7, t137, t155, t164, t168, t180, t184, t211, t237, t239, t246, t247, t248, t251, i0.i0.u57.t...875
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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 : 362/362 places, 328/328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 330 transition count 296
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 330 transition count 296
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 319 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 319 transition count 285
Applied a total of 86 rules in 22 ms. Remains 319 /362 variables (removed 43) and now considering 285/328 (removed 43) transitions.
// Phase 1: matrix 285 rows 319 cols
[2024-05-21 23:50:58] [INFO ] Computed 64 invariants in 3 ms
[2024-05-21 23:50:58] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:50:58] [INFO ] Invariant cache hit.
[2024-05-21 23:50:58] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-21 23:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/319 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/319 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:51:02] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:03] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 20/104 constraints. Problems are: Problem set: 7 solved, 277 unsolved
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:09] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 20/124 constraints. Problems are: Problem set: 14 solved, 270 unsolved
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:12] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 20/144 constraints. Problems are: Problem set: 14 solved, 270 unsolved
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:15] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 3 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 20/164 constraints. Problems are: Problem set: 21 solved, 263 unsolved
[2024-05-21 23:51:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:18] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 5 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:51:19] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 20/184 constraints. Problems are: Problem set: 21 solved, 263 unsolved
[2024-05-21 23:51:22] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:51:23] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:51:24] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
Problem TDEAD253 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 20/204 constraints. Problems are: Problem set: 22 solved, 262 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:27] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:51:28] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 22 solved, 262 unsolved
Search for dead transitions found 22 dead transitions in 30130ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 319/362 places, 263/328 transitions.
Applied a total of 0 rules in 4 ms. Remains 319 /319 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30534 ms. Remains : 319/362 places, 263/328 transitions.
[2024-05-21 23:51:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:28] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 23:51:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:28] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability23964650924056724.gal : 3 ms
[2024-05-21 23:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5310060707164802723.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/CTLFireability23964650924056724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5310060707164802723.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.
Detected timeout of ITS tools.
[2024-05-21 23:51:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:51:59] [INFO ] Applying decomposition
[2024-05-21 23:51:59] [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/graph16269153342503519027.txt' '-o' '/tmp/graph16269153342503519027.bin' '-w' '/tmp/graph16269153342503519027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16269153342503519027.bin' '-l' '-1' '-v' '-w' '/tmp/graph16269153342503519027.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:59] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-21 23:51:59] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:51:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2024-05-21 23:51:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1433823510007728692.gal : 5 ms
[2024-05-21 23:51:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6565958695890546539.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/CTLFireability1433823510007728692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6565958695890546539.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,3.99404e+18,13.2915,375536,19999,51,810864,566,796,909418,71,1444,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:52:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:52:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:52:29] [INFO ] Applying decomposition
[2024-05-21 23:52:29] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17560191784527504599.txt' '-o' '/tmp/graph17560191784527504599.bin' '-w' '/tmp/graph17560191784527504599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17560191784527504599.bin' '-l' '-1' '-v' '-w' '/tmp/graph17560191784527504599.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:29] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-21 23:52:29] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:52:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13331867734393213558.gal : 4 ms
[2024-05-21 23:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14526825515885223628.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/CTLFireability13331867734393213558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14526825515885223628.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.95838e+18,11.7781,347376,10118,67,618664,751,995,990432,77,2647,0


Converting to forward existential form...Done !
original formula: EX(AX(EF((i12.i1.u39.p82==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U (i12.i1.u39.p82==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t33, t172, t187, t194, t206, t210, t216, t222, t320, i0.i0.u49.t163, i0.i0.u51.t159, i0.i...1216
(forward)formula 0,1,24.584,529800,1,0,1.06814e+06,751,6126,1.62746e+06,357,2647,2384619
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AF((EX((i15.u122.p368==1)) + (i2.i1.u45.p127==0))) + (i15.u97.p284==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((i15.u97.p284==1))),!((EX((i15.u122.p368==1)) + (i2.i1.u45.p127==0))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found 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
(forward)formula 1,1,142.737,2803712,1,0,4.79371e+06,751,6437,1.18546e+07,393,2888,6089289
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((AG(AX((i8.i0.u76.p213==1))) + ((!(((i12.i1.u129.p386==1)&&(i12.i0.u130.p389==1))) * (!(((i7.i1.u66.p186==1) * AG((i15.u119.p362==1))))...468
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U !(!(EX(!((i8.i0.u76.p213==1))))))) + ((!(((i12.i1.u129.p386==1)&&(i12.i0.u130.p389==1)))...796
(forward)formula 2,0,752.537,4381924,1,0,6.05237e+06,768,2858,1.58146e+07,180,2952,5441472
FORMULA BusinessProcesses-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-22 00:19:13] [INFO ] Applying decomposition
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:19:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:19:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:19:13] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:19:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 34 ms.
[2024-05-22 00:19:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6737707181552334745.gal : 5 ms
[2024-05-22 00:19:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15389153735057754120.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/CTLFireability6737707181552334745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15389153735057754120.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 5 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:26:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:26:06] [INFO ] Input system was already deterministic with 328 transitions.
[2024-05-22 00:26:06] [INFO ] Transformed 362 places.
[2024-05-22 00:26:06] [INFO ] Transformed 328 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability18298577083920597004.gal : 4 ms
[2024-05-22 00:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14806684463219397489.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18298577083920597004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14806684463219397489.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 5 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-09"
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-09, 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-171620399700514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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