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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716337384036

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:23:05] [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-22 00:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:23:05] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-22 00:23:05] [INFO ] Transformed 772 places.
[2024-05-22 00:23:05] [INFO ] Transformed 685 transitions.
[2024-05-22 00:23:05] [INFO ] Found NUPN structural information;
[2024-05-22 00:23:05] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
Support contains 133 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 101 place count 656 transition count 577
Iterating global reduction 1 with 93 rules applied. Total rules applied 194 place count 656 transition count 577
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 235 place count 615 transition count 536
Iterating global reduction 1 with 41 rules applied. Total rules applied 276 place count 615 transition count 536
Applied a total of 276 rules in 176 ms. Remains 615 /757 variables (removed 142) and now considering 536/670 (removed 134) transitions.
// Phase 1: matrix 536 rows 615 cols
[2024-05-22 00:23:06] [INFO ] Computed 117 invariants in 69 ms
[2024-05-22 00:23:07] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-22 00:23:07] [INFO ] Invariant cache hit.
[2024-05-22 00:23:07] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2024-05-22 00:23:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/615 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 115 places in 258 ms of which 22 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 95 places in 218 ms of which 25 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 10 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 95 places in 279 ms of which 10 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 93 places in 211 ms of which 6 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 110 places in 253 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 116 places in 209 ms of which 2 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 8 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 17 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 120 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1151 variables, and 197 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/615 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (OVERLAPS) 1/615 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/615 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 80/197 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 4 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:23:49] [INFO ] Deduced a trap composed of 116 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 118 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 118 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 142 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 117 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:54] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 126 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 124 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:59] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:00] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:00] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:00] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:24:00] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:00] [INFO ] Deduced a trap composed of 133 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 122 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 103 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 112 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 116 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 535 unsolved
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 114 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 105 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 121 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1151 variables, and 337 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/615 constraints, PredecessorRefiner: 0/535 constraints, Known Traps: 220/220 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 615/757 places, 536/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62459 ms. Remains : 615/757 places, 536/670 transitions.
Support contains 133 out of 615 places after structural reductions.
[2024-05-22 00:24:08] [INFO ] Flatten gal took : 85 ms
[2024-05-22 00:24:08] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:24:08] [INFO ] Input system was already deterministic with 536 transitions.
RANDOM walk for 40000 steps (219 resets) in 1943 ms. (20 steps per ms) remains 43/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
[2024-05-22 00:24:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 266/353 variables, 38/38 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 128/481 variables, 32/71 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 41 unsolved
Problem AtomicPropp71 is UNSAT
At refinement iteration 6 (OVERLAPS) 120/601 variables, 46/117 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 527/1128 variables, 601/718 constraints. Problems are: Problem set: 3 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1128 variables, 0/718 constraints. Problems are: Problem set: 3 solved, 40 unsolved
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 10 (OVERLAPS) 20/1148 variables, 11/729 constraints. Problems are: Problem set: 5 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1148 variables, 0/729 constraints. Problems are: Problem set: 5 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 3/1151 variables, 3/732 constraints. Problems are: Problem set: 5 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1151 variables, 0/732 constraints. Problems are: Problem set: 5 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 0/1151 variables, 0/732 constraints. Problems are: Problem set: 5 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 732 constraints, problems are : Problem set: 5 solved, 38 unsolved in 4413 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 615/615 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 257/324 variables, 33/33 constraints. Problems are: Problem set: 5 solved, 38 unsolved
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 20/53 constraints. Problems are: Problem set: 5 solved, 38 unsolved
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 40 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 14 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 111 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 20/73 constraints. Problems are: Problem set: 5 solved, 38 unsolved
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 105 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 106 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 110 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 111 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 1 ms to minimize.
SMT process timed out in 9507ms, After SMT, problems are : Problem set: 5 solved, 38 unsolved
Fused 38 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 67 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (complete) has 1354 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 56 place count 614 transition count 480
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 559 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 557 transition count 478
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 115 place count 557 transition count 365
Deduced a syphon composed of 113 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 358 place count 427 transition count 365
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 366 place count 419 transition count 357
Iterating global reduction 3 with 8 rules applied. Total rules applied 374 place count 419 transition count 357
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 651 place count 279 transition count 220
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 652 place count 279 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 653 place count 278 transition count 219
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 661 place count 278 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 277 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 663 place count 276 transition count 218
Applied a total of 663 rules in 210 ms. Remains 276 /615 variables (removed 339) and now considering 218/536 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 276/615 places, 218/536 transitions.
RANDOM walk for 40000 steps (1525 resets) in 885 ms. (45 steps per ms) remains 31/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (32 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (30 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (31 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
// Phase 1: matrix 218 rows 276 cols
[2024-05-22 00:24:20] [INFO ] Computed 96 invariants in 4 ms
[2024-05-22 00:24:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 112/162 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 76/238 variables, 43/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 33/271 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 218/489 variables, 271/367 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 5/494 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/494 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 373 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 276/276 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 112/162 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 4 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 19/67 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 0 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 67 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 15/82 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 65 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 69 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 12/94 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 7/101 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 76/238 variables, 43/144 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 20/164 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 20/184 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 20/204 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 20/224 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 20/244 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 20/264 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 20/284 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 20/304 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 7 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/238 variables, 20/324 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 20/344 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 13 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/238 variables, 3/347 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/238 variables, 20/367 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/238 variables, 20/387 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 68 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/238 variables, 20/407 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/238 variables, 7/414 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 7 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 19/433 constraints. Problems are: Problem set: 1 solved, 28 unsolved
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 20/453 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/238 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Problem AtomicPropp69 is UNSAT
At refinement iteration 27 (OVERLAPS) 33/271 variables, 25/478 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/271 variables, 20/498 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/271 variables, 20/518 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/271 variables, 20/538 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:25:03] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/271 variables, 20/558 constraints. Problems are: Problem set: 2 solved, 27 unsolved
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/494 variables, and 565 constraints, problems are : Problem set: 2 solved, 27 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/276 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/29 constraints, Known Traps: 469/469 constraints]
After SMT, in 46093ms problems are : Problem set: 2 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 218/218 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 276 transition count 216
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 274 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 273 transition count 215
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 6 place count 273 transition count 208
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 22 place count 264 transition count 208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 262 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 262 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 261 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 261 transition count 205
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 53 place count 248 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 248 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 247 transition count 191
Applied a total of 55 rules in 57 ms. Remains 247 /276 variables (removed 29) and now considering 191/218 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 247/276 places, 191/218 transitions.
RANDOM walk for 40000 steps (2394 resets) in 1819 ms. (21 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (52 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (52 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (55 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (49 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (52 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (54 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (53 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (49 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 376633 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :14 out of 27
Probabilistic random walk after 376633 steps, saw 81935 distinct states, run finished after 3005 ms. (steps per millisecond=125 ) properties seen :14
// Phase 1: matrix 191 rows 247 cols
[2024-05-22 00:25:09] [INFO ] Computed 93 invariants in 3 ms
[2024-05-22 00:25:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 73/94 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 102/196 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 45/241 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 2/243 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 13/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 16/195 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 191/434 variables, 243/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/434 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 4/438 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 2/449 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/438 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 0/438 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 449 constraints, problems are : Problem set: 1 solved, 12 unsolved in 10511 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 69/88 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 108/196 variables, 60/74 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 4/78 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 7/85 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 9/94 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 15/109 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 45/241 variables, 22/131 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 79/210 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 2/243 variables, 2/212 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 22/234 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 191/434 variables, 243/477 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/434 variables, 1/478 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 11/489 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 4 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/434 variables, 13/502 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 4 ms to minimize.
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/434 variables, 4/506 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/434 variables, 12/518 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/434 variables, 4/522 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/434 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 26 (OVERLAPS) 4/438 variables, 4/526 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/438 variables, 1/527 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/438 variables, 1/528 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/438 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 0/438 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 528 constraints, problems are : Problem set: 1 solved, 12 unsolved in 11643 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 247/247 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 175/175 constraints]
After SMT, in 22178ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 2379 ms.
Support contains 19 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 191/191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 247 transition count 188
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 244 transition count 188
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 244 transition count 181
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 233 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 231 transition count 179
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 231 transition count 179
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 221 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 220 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 220 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 219 transition count 179
Applied a total of 52 rules in 28 ms. Remains 219 /247 variables (removed 28) and now considering 179/191 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 219/247 places, 179/191 transitions.
RANDOM walk for 40000 steps (2978 resets) in 273 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (908 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (907 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (888 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (931 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (884 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (889 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (795 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (701 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (901 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (886 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (898 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (899 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 727904 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :11 out of 12
Probabilistic random walk after 727904 steps, saw 183781 distinct states, run finished after 3002 ms. (steps per millisecond=242 ) properties seen :11
// Phase 1: matrix 179 rows 219 cols
[2024-05-22 00:25:38] [INFO ] Computed 89 invariants in 6 ms
[2024-05-22 00:25:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/180 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/183 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/215 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 179/394 variables, 215/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/398 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 219/219 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/180 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 4 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 0 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/183 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/215 variables, 19/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 179/394 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/398 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/398 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/398 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/398 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/398 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6257 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 219/219 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 105/105 constraints]
After SMT, in 7169ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 179/179 transitions.
Graph (trivial) has 20 edges and 219 vertex of which 2 / 219 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 218 transition count 172
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 213 transition count 172
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 11 place count 213 transition count 167
Deduced a syphon composed of 5 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 23 place count 206 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 204 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 204 transition count 165
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 44 place count 195 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 195 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 193 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 192 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 191 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 191 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 52 place count 190 transition count 153
Applied a total of 52 rules in 106 ms. Remains 190 /219 variables (removed 29) and now considering 153/179 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 190/219 places, 153/179 transitions.
RANDOM walk for 40000 steps (1350 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (348 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Probably explored full state space saw : 155617 states, properties seen :0
Probabilistic random walk after 473138 steps, saw 155617 distinct states, run finished after 1631 ms. (steps per millisecond=290 ) properties seen :0
Explored full state space saw : 155617 states, properties seen :0
Exhaustive walk after 473138 steps, saw 155617 distinct states, run finished after 1426 ms. (steps per millisecond=331 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:25:48] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:25:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:25:48] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:25:48] [INFO ] Input system was already deterministic with 536 transitions.
Support contains 94 out of 615 places (down from 104) after GAL structural reductions.
Computed a total of 558 stabilizing places and 489 stable transitions
Graph (complete) has 1354 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 584 transition count 505
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Applied a total of 68 rules in 110 ms. Remains 581 /615 variables (removed 34) and now considering 502/536 (removed 34) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-22 00:25:49] [INFO ] Computed 117 invariants in 5 ms
[2024-05-22 00:25:49] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-22 00:25:49] [INFO ] Invariant cache hit.
[2024-05-22 00:25:50] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-22 00:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 120 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 17 solved, 484 unsolved
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:26:15] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 17 solved, 484 unsolved
[2024-05-22 00:26:16] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:26:16] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:16] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:16] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:16] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 101 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 17 solved, 484 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 217 constraints, problems are : Problem set: 17 solved, 484 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 17 solved, 484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 17 solved, 484 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 100/217 constraints. Problems are: Problem set: 17 solved, 484 unsolved
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 115 places in 208 ms of which 5 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 103 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 104 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/237 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/257 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/277 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 103 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/297 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 121 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/317 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 20/337 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 20/357 constraints. Problems are: Problem set: 29 solved, 472 unsolved
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 5 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 60194ms, After SMT, problems are : Problem set: 29 solved, 472 unsolved
Search for dead transitions found 29 dead transitions in 60198ms
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 : 581/615 places, 473/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 580 transition count 473
Applied a total of 1 rules in 19 ms. Remains 580 /581 variables (removed 1) and now considering 473/473 (removed 0) transitions.
// Phase 1: matrix 473 rows 580 cols
[2024-05-22 00:26:50] [INFO ] Computed 119 invariants in 5 ms
[2024-05-22 00:26:50] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-22 00:26:50] [INFO ] Invariant cache hit.
[2024-05-22 00:26:51] [INFO ] Implicit Places using invariants and state equation in 770 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1084 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 579/615 places, 473/536 transitions.
Applied a total of 0 rules in 11 ms. Remains 579 /579 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62349 ms. Remains : 579/615 places, 473/536 transitions.
[2024-05-22 00:26:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:26:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:26:51] [INFO ] Input system was already deterministic with 473 transitions.
[2024-05-22 00:26:51] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:26:51] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4428872429950008654.gal : 18 ms
[2024-05-22 00:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6051625142115166392.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/CTLFireability4428872429950008654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6051625142115166392.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-22 00:27:21] [INFO ] Flatten gal took : 50 ms
[2024-05-22 00:27:21] [INFO ] Applying decomposition
[2024-05-22 00:27:21] [INFO ] Flatten gal took : 28 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/graph17022048823867982985.txt' '-o' '/tmp/graph17022048823867982985.bin' '-w' '/tmp/graph17022048823867982985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17022048823867982985.bin' '-l' '-1' '-v' '-w' '/tmp/graph17022048823867982985.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:27:21] [INFO ] Decomposing Gal with order
[2024-05-22 00:27:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:27:21] [INFO ] Removed a total of 159 redundant transitions.
[2024-05-22 00:27:21] [INFO ] Flatten gal took : 84 ms
[2024-05-22 00:27:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 21 ms.
[2024-05-22 00:27:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7147697608936141315.gal : 12 ms
[2024-05-22 00:27:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4934274642574864461.ctl : 16 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/CTLFireability7147697608936141315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4934274642574864461.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,1.24998,52560,5325,53,95477,614,1136,227423,68,1478,0


Converting to forward existential form...Done !
original formula: AG((AG(EF((i18.i1.u127.p401==1))) + (AX((((i4.u42.p121!=1)||(i4.u138.p463!=1))||(i4.u170.p632!=1))) * (AX((i21.u183.p701==1)) + (i12.u89....167
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(!(E(TRUE U !(E(TRUE U (i18.i1.u127.p401==1)))))))) * !((((i4.u42.p121!=1)||(i4.u138.p...333
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t203, t287, t303, t307, t344, t392, t437, t441, t443, t446, t448, t450, t459, t46...1590
(forward)formula 0,0,7.55071,299124,1,0,595589,715,7761,1.2906e+06,352,1730,1364026
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 608 transition count 451
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 531 transition count 451
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 156 place count 531 transition count 325
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 432 place count 381 transition count 325
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 456 place count 357 transition count 301
Iterating global reduction 2 with 24 rules applied. Total rules applied 480 place count 357 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 480 place count 357 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 482 place count 356 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 483 place count 355 transition count 299
Iterating global reduction 2 with 1 rules applied. Total rules applied 484 place count 355 transition count 299
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 789 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 790 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 791 place count 198 transition count 148
Applied a total of 791 rules in 108 ms. Remains 198 /615 variables (removed 417) and now considering 148/536 (removed 388) transitions.
// Phase 1: matrix 148 rows 198 cols
[2024-05-22 00:27:29] [INFO ] Computed 87 invariants in 1 ms
[2024-05-22 00:27:30] [INFO ] Implicit Places using invariants in 324 ms returned [0, 1, 2, 3, 4, 12, 13, 16, 17, 18, 19, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 326 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 171/615 places, 148/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 171 /171 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 448 ms. Remains : 171/615 places, 148/536 transitions.
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:30] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:27:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality379354721414519119.gal : 2 ms
[2024-05-22 00:27:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1310382598052193205.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/ReachabilityCardinality379354721414519119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1310382598052193205.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality1310382598052193205.prop.
RANDOM walk for 33089 steps (5644 resets) in 478 ms. (69 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 298 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 608 transition count 453
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 533 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 532 transition count 452
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 154 place count 532 transition count 328
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 427 place count 383 transition count 328
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 449 place count 361 transition count 306
Iterating global reduction 3 with 22 rules applied. Total rules applied 471 place count 361 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 471 place count 361 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 473 place count 360 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 474 place count 359 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 475 place count 359 transition count 304
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 299 rules applied. Total rules applied 774 place count 208 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 775 place count 207 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 776 place count 206 transition count 155
Applied a total of 776 rules in 63 ms. Remains 206 /615 variables (removed 409) and now considering 155/536 (removed 381) transitions.
// Phase 1: matrix 155 rows 206 cols
[2024-05-22 00:27:30] [INFO ] Computed 88 invariants in 1 ms
[2024-05-22 00:27:30] [INFO ] Implicit Places using invariants in 407 ms returned [0, 1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 22, 23, 24, 50, 51, 52, 53, 56, 57, 58, 59, 60, 61, 62, 63]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 408 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 179/615 places, 155/536 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 477 ms. Remains : 179/615 places, 155/536 transitions.
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:30] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:27:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17034607588334626765.gal : 4 ms
[2024-05-22 00:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability18708394325952928.ctl : 13 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/CTLFireability17034607588334626765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18708394325952928.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04532e+07,0.126524,10224,2,3379,5,18758,6,0,869,14321,0


Converting to forward existential form...Done !
original formula: EF((A(!(A((p596==1) U (p385==1))) U ((p405==1)||(((p241==1)&&(p513==1))&&(p693==1)))) * (p165==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p165==1)) * !(EG(!(((p405==1)||(((p241==1)&&(p513==1))&&(p693==1))))))) * !(E(!(((p405==1...344
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t37, t38, t41, t42, t43, t44, t69, t70, t71, t72, t73, t94, t96, t97, t98, t112, t120...311
(forward)formula 0,0,3.74059,139080,1,0,453,789902,307,233,6350,721996,552
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 595 transition count 516
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 595 transition count 516
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 588 transition count 509
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 588 transition count 509
Applied a total of 54 rules in 56 ms. Remains 588 /615 variables (removed 27) and now considering 509/536 (removed 27) transitions.
// Phase 1: matrix 509 rows 588 cols
[2024-05-22 00:27:34] [INFO ] Computed 117 invariants in 3 ms
[2024-05-22 00:27:35] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-22 00:27:35] [INFO ] Invariant cache hit.
[2024-05-22 00:27:36] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2024-05-22 00:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/587 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (OVERLAPS) 1/588 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 8 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 5 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 12 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 86 places in 245 ms of which 6 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:59] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 125 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 124 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 30201ms
Starting structural reductions in LTL mode, iteration 1 : 588/615 places, 509/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31589 ms. Remains : 588/615 places, 509/536 transitions.
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:28:06] [INFO ] Input system was already deterministic with 509 transitions.
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 33 ms
[2024-05-22 00:28:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15889117738688166249.gal : 15 ms
[2024-05-22 00:28:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17997269011135979667.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/CTLFireability15889117738688166249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17997269011135979667.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-22 00:28:36] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:28:36] [INFO ] Applying decomposition
[2024-05-22 00:28:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12798165364389558909.txt' '-o' '/tmp/graph12798165364389558909.bin' '-w' '/tmp/graph12798165364389558909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12798165364389558909.bin' '-l' '-1' '-v' '-w' '/tmp/graph12798165364389558909.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:36] [INFO ] Removed a total of 292 redundant transitions.
[2024-05-22 00:28:36] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:28:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-22 00:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17630370110123874075.gal : 5 ms
[2024-05-22 00:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9180649808163949480.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/CTLFireability17630370110123874075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9180649808163949480.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,2.279e+33,2.20404,80380,7174,63,149288,858,1099,296432,68,2301,0


Converting to forward existential form...Done !
original formula: EF((AG(((i20.u189.p703==0) + EG((i20.u190.p708==0)))) * E((AX(A((i15.u36.p93==1) U (i10.u90.p269==1))) + (i20.u161.p565!=1)) U E(EG((i7.i...329
=> equivalent forward existential formula: [(FwdU(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(((i20.u189.p703==0) + EG((i20.u190.p708==0))))))),(!(EX(!(!((E(!((i1...464
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t206, t291, t307, t315, t319, t395, t398, t471, t472, t476, t478, t480, t481...1519
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (complete) has 1354 edges and 615 vertex of which 614 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 614 transition count 467
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 546 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 545 transition count 466
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 139 place count 545 transition count 335
Deduced a syphon composed of 131 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 425 place count 390 transition count 335
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 446 place count 369 transition count 314
Iterating global reduction 3 with 21 rules applied. Total rules applied 467 place count 369 transition count 314
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 752 place count 224 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 753 place count 223 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 754 place count 223 transition count 173
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 760 place count 223 transition count 173
Applied a total of 760 rules in 47 ms. Remains 223 /615 variables (removed 392) and now considering 173/536 (removed 363) transitions.
// Phase 1: matrix 173 rows 223 cols
[2024-05-22 00:29:06] [INFO ] Computed 88 invariants in 4 ms
[2024-05-22 00:29:06] [INFO ] Implicit Places using invariants in 161 ms returned [63, 64, 65, 66, 67, 68, 69, 72, 73]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 162 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 214/615 places, 173/536 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 214 ms. Remains : 214/615 places, 173/536 transitions.
[2024-05-22 00:29:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:29:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:29:06] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 00:29:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:29:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:29:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3819699728622153486.gal : 2 ms
[2024-05-22 00:29:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7897133264867612993.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/CTLFireability3819699728622153486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7897133264867612993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90892e+08,2.44314,73652,2,22309,5,291323,6,0,1031,231445,0


Converting to forward existential form...Done !
original formula: E(!(A((p659==1) U ((AG((((p215==1)&&(p498==1))&&(p769==1))) * !((((p236==1)&&(p522==1))&&(p737==1)))) * (p20==1)))) U (((p225==1)||(((p19...374
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(!(((!(E(TRUE U !((((p215==1)&&(p498==1))&&(p769==1))))) * !((((p236==1)&&(p522==1))&&...1713
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t17, t63, t69, t73, t74, t75, t76, t77, t92, t93, t94, t95, t96, t99, t101, t102, t1...332
Detected timeout of ITS tools.
[2024-05-22 00:29:37] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:29:37] [INFO ] Applying decomposition
[2024-05-22 00:29:37] [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/graph5373195983569312373.txt' '-o' '/tmp/graph5373195983569312373.bin' '-w' '/tmp/graph5373195983569312373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5373195983569312373.bin' '-l' '-1' '-v' '-w' '/tmp/graph5373195983569312373.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:29:37] [INFO ] Decomposing Gal with order
[2024-05-22 00:29:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:29:37] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 00:29:37] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:29:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 9 ms.
[2024-05-22 00:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14839439410266057609.gal : 4 ms
[2024-05-22 00:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15941721051605863743.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/CTLFireability14839439410266057609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15941721051605863743.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.90892e+08,0.192296,12744,993,541,18252,3512,650,26641,190,11614,0


Converting to forward existential form...Done !
original formula: E(!(A((i6.u64.p659==1) U ((AG((((u40.p215==1)&&(u40.p498==1))&&(u40.p769==1))) * !((((i0.u14.p236==1)&&(i0.u45.p522==1))&&(i1.u54.p737==1...527
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((E(!(((!(E(TRUE U !((((u40.p215==1)&&(u40.p498==1))&&(u40.p769==1))))) * !((((i0.u14.p23...2265
Reverse transition relation is NOT exact ! Due to transitions t63, t73, t74, t75, t76, t93, t94, t95, t96, t101, t102, t115, t126, t134, t143, t144, t145, ...382
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 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 a local 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
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
(forward)formula 0,1,1.5791,85872,1,0,150201,10668,3905,383008,1697,42866,310667
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 123 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
// Phase 1: matrix 499 rows 578 cols
[2024-05-22 00:29:38] [INFO ] Computed 117 invariants in 5 ms
[2024-05-22 00:29:39] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-22 00:29:39] [INFO ] Invariant cache hit.
[2024-05-22 00:29:39] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-05-22 00:29:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 7 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 120 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 108 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 30145ms, After SMT, problems are : Problem set: 15 solved, 483 unsolved
Search for dead transitions found 15 dead transitions in 30153ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/615 places, 484/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 578 /578 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31184 ms. Remains : 578/615 places, 484/536 transitions.
[2024-05-22 00:30:10] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:30:10] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:30:10] [INFO ] Input system was already deterministic with 484 transitions.
[2024-05-22 00:30:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:30:10] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4440588566545236098.gal : 3 ms
[2024-05-22 00:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10516746106708117672.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/CTLFireability4440588566545236098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10516746106708117672.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-22 00:30:40] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:30:40] [INFO ] Applying decomposition
[2024-05-22 00:30:40] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15190244881452419215.txt' '-o' '/tmp/graph15190244881452419215.bin' '-w' '/tmp/graph15190244881452419215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15190244881452419215.bin' '-l' '-1' '-v' '-w' '/tmp/graph15190244881452419215.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:40] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:40] [INFO ] Removed a total of 219 redundant transitions.
[2024-05-22 00:30:40] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:30:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-22 00:30:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7527978968953467678.gal : 7 ms
[2024-05-22 00:30:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7606811096145904344.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/CTLFireability7527978968953467678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7606811096145904344.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,15.677,329124,8050,57,508912,692,1241,1.04648e+06,68,1650,0


Converting to forward existential form...Done !
original formula: AG(EX(((EG(((A((((i0.u91.p271==1)&&(i8.i1.u158.p552==1))&&(i19.u160.p737==1)) U (i13.i1.u133.p425==1)) + (i20.i1.u72.p213==0)) + (i20.i1....267
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((EG(((!((E(!((i13.i1.u133.p425==1)) U (!((((i0.u91.p271==1)&&(i8.i1.u158.p552==1))&&(i...398
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t200, t284, t296, t304, t386, t389, t447, t448, t452, t454, t456, t457, t459...1577
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 592 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 592 transition count 513
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 583 transition count 504
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 115 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:31:10] [INFO ] Computed 117 invariants in 10 ms
[2024-05-22 00:31:10] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-22 00:31:10] [INFO ] Invariant cache hit.
[2024-05-22 00:31:11] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:31:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 118 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 6 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 3 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 16 solved, 484 unsolved
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 3 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 92 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 109 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD441 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 23 solved, 477 unsolved
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 3 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 475 unsolved
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 25 solved, 475 unsolved
Search for dead transitions found 25 dead transitions in 30174ms
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 : 580/615 places, 476/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31296 ms. Remains : 580/615 places, 476/536 transitions.
[2024-05-22 00:31:41] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:31:41] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:31:41] [INFO ] Input system was already deterministic with 476 transitions.
[2024-05-22 00:31:41] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:31:41] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2356101718888673206.gal : 17 ms
[2024-05-22 00:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6120671689768851465.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/CTLFireability2356101718888673206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6120671689768851465.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-22 00:32:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:32:11] [INFO ] Applying decomposition
[2024-05-22 00:32:11] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2710026964172790571.txt' '-o' '/tmp/graph2710026964172790571.bin' '-w' '/tmp/graph2710026964172790571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2710026964172790571.bin' '-l' '-1' '-v' '-w' '/tmp/graph2710026964172790571.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:32:12] [INFO ] Decomposing Gal with order
[2024-05-22 00:32:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:32:12] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-22 00:32:12] [INFO ] Flatten gal took : 64 ms
[2024-05-22 00:32:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 30 ms.
[2024-05-22 00:32:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7037546348045855720.gal : 13 ms
[2024-05-22 00:32:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11518018449699707141.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/CTLFireability7037546348045855720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11518018449699707141.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29238e+33,7.20219,183316,7660,46,288094,680,1190,965824,60,1811,0


Converting to forward existential form...Done !
original formula: E((!(AF(((AX((i18.i1.u121.p361==1)) * !((((i17.i0.u22.p50==1)&&(i17.i1.u128.p392==1))&&(i20.u162.p737==1)))) * (i0.i1.u158.p546==1)))) + ...200
=> equivalent forward existential formula: [(FwdU(Init,(!(!(EG(!(((!(EX(!((i18.i1.u121.p361==1)))) * !((((i17.i0.u22.p50==1)&&(i17.i1.u128.p392==1))&&(i20....258
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t202, t286, t302, t310, t388, t391, t439, t440, t444, t446, t448, t449, t451, t453, t...1608
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 6 / 615 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1348 edges and 610 vertex of which 609 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 608 transition count 451
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 531 transition count 451
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 156 place count 531 transition count 323
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 436 place count 379 transition count 323
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 460 place count 355 transition count 299
Iterating global reduction 2 with 24 rules applied. Total rules applied 484 place count 355 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 485 place count 354 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 486 place count 354 transition count 298
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 785 place count 202 transition count 151
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 791 place count 202 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 792 place count 201 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 793 place count 200 transition count 150
Applied a total of 793 rules in 94 ms. Remains 200 /615 variables (removed 415) and now considering 150/536 (removed 386) transitions.
// Phase 1: matrix 150 rows 200 cols
[2024-05-22 00:32:42] [INFO ] Computed 87 invariants in 4 ms
[2024-05-22 00:32:42] [INFO ] Implicit Places using invariants in 172 ms returned [50, 51, 52, 53, 54, 55, 58, 59, 60, 61, 62, 63, 170]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 174 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 187/615 places, 150/536 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 275 ms. Remains : 187/615 places, 150/536 transitions.
[2024-05-22 00:32:42] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:32:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:32:42] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-22 00:32:42] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:32:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:32:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9092499981114475270.gal : 1 ms
[2024-05-22 00:32:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17691067644450600667.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/CTLFireability9092499981114475270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17691067644450600667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.47684e+06,0.742116,24768,2,5691,5,76957,6,0,895,55960,0


Converting to forward existential form...Done !
original formula: AG(AF((EF((p258==1)) + AG(((p21==0)&&(((p197==0)||(p498==0))||(p674==0)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(TRUE U (p258==1)) + !(E(TRUE U !(((p21==0)&&(((p197==0)||(p498==0))||(p674==0))))))))...165
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t47, t48, t49, t72, t73, t74, t75, t76, t78, t94, t95, t113, t114, t115, t116, t117...287
(forward)formula 0,1,3.48966,84688,1,0,212,399516,292,117,6612,177000,294
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 583 transition count 504
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 83 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:32:46] [INFO ] Computed 117 invariants in 11 ms
[2024-05-22 00:32:46] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 00:32:46] [INFO ] Invariant cache hit.
[2024-05-22 00:32:47] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:32:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 20 solved, 480 unsolved
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 480 unsolved
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 24 solved, 476 unsolved
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:33:15] [INFO ] Deduced a trap composed of 117 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:33:15] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:15] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:33:15] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:15] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 225 constraints, problems are : Problem set: 26 solved, 474 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 26 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 26 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 26 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 26 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 26 solved, 474 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 108/225 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-22 00:33:21] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:33:21] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:21] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:21] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 4 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:33:22] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:33:23] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:33:24] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 2 ms to minimize.
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/245 constraints. Problems are: Problem set: 27 solved, 473 unsolved
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:25] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 121 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:33:26] [INFO ] Deduced a trap composed of 100 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
Problem TDEAD433 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/265 constraints. Problems are: Problem set: 28 solved, 472 unsolved
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:31] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:32] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:33:32] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:33:32] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:33:32] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:32] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/285 constraints. Problems are: Problem set: 28 solved, 472 unsolved
[2024-05-22 00:33:33] [INFO ] Deduced a trap composed of 107 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:33:33] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:33] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:33] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:34] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:33:35] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:36] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 3 ms to minimize.
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/305 constraints. Problems are: Problem set: 31 solved, 469 unsolved
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:37] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:38] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:33:39] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:33:40] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 20/325 constraints. Problems are: Problem set: 31 solved, 469 unsolved
[2024-05-22 00:33:41] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:33:42] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 103 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:33:43] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 6 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:44] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:33:45] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:33:45] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:33:45] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 20/345 constraints. Problems are: Problem set: 31 solved, 469 unsolved
[2024-05-22 00:33:46] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:46] [INFO ] Deduced a trap composed of 103 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:33:46] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:46] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:33:47] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 60258ms, After SMT, problems are : Problem set: 31 solved, 469 unsolved
Search for dead transitions found 31 dead transitions in 60265ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/615 places, 470/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 579 transition count 470
Applied a total of 1 rules in 10 ms. Remains 579 /580 variables (removed 1) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 579 cols
[2024-05-22 00:33:47] [INFO ] Computed 121 invariants in 5 ms
[2024-05-22 00:33:47] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-22 00:33:47] [INFO ] Invariant cache hit.
[2024-05-22 00:33:48] [INFO ] Implicit Places using invariants and state equation in 629 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 885 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/615 places, 470/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 577 /577 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62275 ms. Remains : 577/615 places, 470/536 transitions.
[2024-05-22 00:33:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:33:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:48] [INFO ] Input system was already deterministic with 470 transitions.
[2024-05-22 00:33:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:33:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17026763111667886111.gal : 2 ms
[2024-05-22 00:33:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15258592485474401920.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/CTLFireability17026763111667886111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15258592485474401920.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-22 00:34:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:34:18] [INFO ] Applying decomposition
[2024-05-22 00:34:18] [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/graph6073192480025500108.txt' '-o' '/tmp/graph6073192480025500108.bin' '-w' '/tmp/graph6073192480025500108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6073192480025500108.bin' '-l' '-1' '-v' '-w' '/tmp/graph6073192480025500108.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:34:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:34:18] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-22 00:34:18] [INFO ] Flatten gal took : 50 ms
[2024-05-22 00:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2024-05-22 00:34:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9562947783985950189.gal : 12 ms
[2024-05-22 00:34:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10820649957253788402.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/CTLFireability9562947783985950189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10820649957253788402.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24523e+33,1.44558,52296,5300,46,94684,662,1176,185878,59,1917,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((((i2.u93.p281==1)||(i20.u158.p692==1))||(((i20.u158.p704==1)&&(i1.u96.p289==1))&&((i19.i0.u130.p417==1)&&(i20.u158.p737==1)))))...157
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((((i2.u93.p281==1)||(i20.u158.p692==1))||(((i20.u158.p704==1)&&(i1.u96.p289...221
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t202, t286, t302, t310, t388, t391, t433, t438, t440, t442, t445, t447, t456, t465, i...1593
(forward)formula 0,0,9.44617,302832,1,0,608242,662,7604,929465,307,1917,1735948
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-08 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 : 615/615 places, 536/536 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 591 transition count 512
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 583 transition count 504
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 582 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Applied a total of 70 rules in 114 ms. Remains 580 /615 variables (removed 35) and now considering 501/536 (removed 35) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:34:28] [INFO ] Computed 117 invariants in 8 ms
[2024-05-22 00:34:28] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-22 00:34:28] [INFO ] Invariant cache hit.
[2024-05-22 00:34:29] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 5 solved, 495 unsolved
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 121 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 5 solved, 495 unsolved
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 26 solved, 474 unsolved
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:34:57] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:58] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 4 ms to minimize.
[2024-05-22 00:34:59] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 26 solved, 474 unsolved
Search for dead transitions found 26 dead transitions in 30110ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/615 places, 475/536 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 579 transition count 475
Applied a total of 1 rules in 12 ms. Remains 579 /580 variables (removed 1) and now considering 475/475 (removed 0) transitions.
// Phase 1: matrix 475 rows 579 cols
[2024-05-22 00:34:59] [INFO ] Computed 117 invariants in 4 ms
[2024-05-22 00:34:59] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 00:34:59] [INFO ] Invariant cache hit.
[2024-05-22 00:35:00] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 858 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/615 places, 475/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 577 /577 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32051 ms. Remains : 577/615 places, 475/536 transitions.
[2024-05-22 00:35:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:35:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:35:00] [INFO ] Input system was already deterministic with 475 transitions.
[2024-05-22 00:35:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:35:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:35:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15388650156322193403.gal : 2 ms
[2024-05-22 00:35:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3291973071443290512.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/CTLFireability15388650156322193403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3291973071443290512.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-22 00:35:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:35:30] [INFO ] Applying decomposition
[2024-05-22 00:35:30] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4290368762767631365.txt' '-o' '/tmp/graph4290368762767631365.bin' '-w' '/tmp/graph4290368762767631365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4290368762767631365.bin' '-l' '-1' '-v' '-w' '/tmp/graph4290368762767631365.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:30] [INFO ] Removed a total of 176 redundant transitions.
[2024-05-22 00:35:30] [INFO ] Flatten gal took : 37 ms
[2024-05-22 00:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:35:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10533096521393481042.gal : 22 ms
[2024-05-22 00:35:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17008827375874541424.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/CTLFireability10533096521393481042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17008827375874541424.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,2.7676,86696,7878,56,130763,1399,1181,295767,70,3173,0


Converting to forward existential form...Done !
original formula: EX(EF((i22.u166.p599==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (i22.u166.p599==1))] != FALSE
(forward)formula 0,1,4.70967,89072,1,0,132239,1399,2774,310624,124,3173,442068
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-09 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 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 113 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
// Phase 1: matrix 499 rows 578 cols
[2024-05-22 00:35:35] [INFO ] Computed 117 invariants in 3 ms
[2024-05-22 00:35:35] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 00:35:35] [INFO ] Invariant cache hit.
[2024-05-22 00:35:36] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-05-22 00:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-22 00:35:45] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:35:46] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:47] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:48] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:49] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:50] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:51] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 7 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:35:52] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:53] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 18 solved, 480 unsolved
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 18 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 237 constraints, problems are : Problem set: 18 solved, 480 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 18 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 120/237 constraints. Problems are: Problem set: 18 solved, 480 unsolved
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 20 solved, 478 unsolved
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 22 solved, 476 unsolved
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 116 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/297 constraints. Problems are: Problem set: 26 solved, 472 unsolved
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/317 constraints. Problems are: Problem set: 29 solved, 469 unsolved
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:24] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:36:25] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 17 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
Problem TDEAD439 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/337 constraints. Problems are: Problem set: 30 solved, 468 unsolved
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/357 constraints. Problems are: Problem set: 30 solved, 468 unsolved
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 167 places in 171 ms of which 5 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 150 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 2 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:36] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 60133ms, After SMT, problems are : Problem set: 30 solved, 468 unsolved
Search for dead transitions found 30 dead transitions in 60142ms
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 : 578/615 places, 469/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 576 transition count 469
Applied a total of 2 rules in 13 ms. Remains 576 /578 variables (removed 2) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 576 cols
[2024-05-22 00:36:36] [INFO ] Computed 119 invariants in 3 ms
[2024-05-22 00:36:36] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 00:36:36] [INFO ] Invariant cache hit.
[2024-05-22 00:36:37] [INFO ] Implicit Places using invariants and state equation in 501 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 575/615 places, 469/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 575 /575 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61887 ms. Remains : 575/615 places, 469/536 transitions.
[2024-05-22 00:36:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:36:37] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:36:37] [INFO ] Input system was already deterministic with 469 transitions.
[2024-05-22 00:36:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:36:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13304967727990849295.gal : 2 ms
[2024-05-22 00:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5386196278127280168.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/CTLFireability13304967727990849295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5386196278127280168.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-22 00:37:07] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:37:07] [INFO ] Applying decomposition
[2024-05-22 00:37:07] [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/graph5588960600686755790.txt' '-o' '/tmp/graph5588960600686755790.bin' '-w' '/tmp/graph5588960600686755790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5588960600686755790.bin' '-l' '-1' '-v' '-w' '/tmp/graph5588960600686755790.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:07] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:07] [INFO ] Removed a total of 156 redundant transitions.
[2024-05-22 00:37:07] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2024-05-22 00:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1574459488061723009.gal : 8 ms
[2024-05-22 00:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7779554332686531421.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/CTLFireability1574459488061723009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7779554332686531421.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,3.80317,110024,7628,55,187225,1215,1145,346016,70,2691,0


Converting to forward existential form...Done !
original formula: (!(A((((i0.i0.u1.p2==1) * AF(((i12.i0.u145.p495==1)||(i5.u11.p28==1)))) * !((EG(((i10.u48.p141==1)&&(i23.u159.p571==1))) + ((i8.i0.u15.p3...305
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U !(E(TRUE U !(!(EG(!((i1.i0.u96.p293==1)))))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(!(EG...550
Reverse transition relation is NOT exact ! Due to transitions t8, t284, t300, t304, t312, t386, t389, t432, t433, t437, t439, t441, t442, t444, t446, t455,...1518
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 an SCC at level 11
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 582 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 582 transition count 503
Applied a total of 66 rules in 30 ms. Remains 582 /615 variables (removed 33) and now considering 503/536 (removed 33) transitions.
// Phase 1: matrix 503 rows 582 cols
[2024-05-22 00:37:37] [INFO ] Computed 117 invariants in 9 ms
[2024-05-22 00:37:37] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:37:37] [INFO ] Invariant cache hit.
[2024-05-22 00:37:38] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-22 00:37:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 5 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 15 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 9 solved, 493 unsolved
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:37:57] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:58] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 487 unsolved
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 487 unsolved
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 20/217 constraints. Problems are: Problem set: 17 solved, 485 unsolved
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 108 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 108 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30197ms, After SMT, problems are : Problem set: 17 solved, 485 unsolved
Search for dead transitions found 17 dead transitions in 30204ms
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 : 582/615 places, 486/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 582 /582 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31031 ms. Remains : 582/615 places, 486/536 transitions.
[2024-05-22 00:38:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:38:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:38:08] [INFO ] Input system was already deterministic with 486 transitions.
[2024-05-22 00:38:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:38:08] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14421483708853733420.gal : 2 ms
[2024-05-22 00:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13166697675486014199.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/CTLFireability14421483708853733420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13166697675486014199.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-22 00:38:38] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:38:38] [INFO ] Applying decomposition
[2024-05-22 00:38:38] [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/graph12270556381892443762.txt' '-o' '/tmp/graph12270556381892443762.bin' '-w' '/tmp/graph12270556381892443762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12270556381892443762.bin' '-l' '-1' '-v' '-w' '/tmp/graph12270556381892443762.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:38:38] [INFO ] Decomposing Gal with order
[2024-05-22 00:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:38:38] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-22 00:38:38] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-22 00:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1691889733913063823.gal : 8 ms
[2024-05-22 00:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10316001391035921594.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/CTLFireability1691889733913063823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10316001391035921594.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,2.10873e+33,5.55977,112912,6954,42,169412,557,1227,471406,48,1460,0


Converting to forward existential form...Done !
original formula: (EX(((i6.i0.u177.p649==0) * AF((i9.i0.u88.p264==1)))) + EX(((((A((i9.i0.u90.p270==1) U (i2.u9.p20==1)) * (A((i8.i0.u102.p316==1) U (((i4....344
=> equivalent forward existential formula: ([((EY(Init) * (i6.i0.u177.p649==0)) * !(EG(!((i9.i0.u88.p264==1)))))] != FALSE + (([(((((EY(Init) * (i18.i0.u50...863
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t287, t303, t344, t389, t392, t449, t453, t455, t457, t458, t460, t462, t472, t480, ...1599
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 536/536 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 590 transition count 511
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 581 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 578 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 578 transition count 499
Applied a total of 74 rules in 82 ms. Remains 578 /615 variables (removed 37) and now considering 499/536 (removed 37) transitions.
// Phase 1: matrix 499 rows 578 cols
[2024-05-22 00:39:09] [INFO ] Computed 117 invariants in 5 ms
[2024-05-22 00:39:09] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 00:39:09] [INFO ] Invariant cache hit.
[2024-05-22 00:39:10] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-05-22 00:39:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 121 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 7 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 18 solved, 480 unsolved
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 1 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/237 constraints. Problems are: Problem set: 18 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 237 constraints, problems are : Problem set: 18 solved, 480 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 18 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 120/237 constraints. Problems are: Problem set: 18 solved, 480 unsolved
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/257 constraints. Problems are: Problem set: 20 solved, 478 unsolved
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 129 places in 141 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/277 constraints. Problems are: Problem set: 22 solved, 476 unsolved
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/297 constraints. Problems are: Problem set: 26 solved, 472 unsolved
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 110 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/317 constraints. Problems are: Problem set: 29 solved, 469 unsolved
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:59] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:40:00] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:40:00] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
Problem TDEAD439 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/337 constraints. Problems are: Problem set: 30 solved, 468 unsolved
[2024-05-22 00:40:00] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:40:00] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:40:00] [INFO ] Deduced a trap composed of 108 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/357 constraints. Problems are: Problem set: 30 solved, 468 unsolved
[2024-05-22 00:40:04] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:40:07] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:40:07] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:40:07] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 149 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 3 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:40:10] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:40:10] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 7 ms to minimize.
SMT process timed out in 60114ms, After SMT, problems are : Problem set: 30 solved, 468 unsolved
Search for dead transitions found 30 dead transitions in 60118ms
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 : 578/615 places, 469/536 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 576 transition count 469
Applied a total of 2 rules in 13 ms. Remains 576 /578 variables (removed 2) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 576 cols
[2024-05-22 00:40:10] [INFO ] Computed 119 invariants in 4 ms
[2024-05-22 00:40:10] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-22 00:40:10] [INFO ] Invariant cache hit.
[2024-05-22 00:40:11] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 895 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 575/615 places, 469/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 575 /575 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62132 ms. Remains : 575/615 places, 469/536 transitions.
[2024-05-22 00:40:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:40:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:40:11] [INFO ] Input system was already deterministic with 469 transitions.
[2024-05-22 00:40:11] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:40:11] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:40:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6377914371696535475.gal : 2 ms
[2024-05-22 00:40:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8539858509750340267.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/CTLFireability6377914371696535475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8539858509750340267.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-22 00:40:41] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:40:41] [INFO ] Applying decomposition
[2024-05-22 00:40:41] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3839871206608749868.txt' '-o' '/tmp/graph3839871206608749868.bin' '-w' '/tmp/graph3839871206608749868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3839871206608749868.bin' '-l' '-1' '-v' '-w' '/tmp/graph3839871206608749868.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:41] [INFO ] Removed a total of 158 redundant transitions.
[2024-05-22 00:40:41] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 13 ms.
[2024-05-22 00:40:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11994602133238297514.gal : 6 ms
[2024-05-22 00:40:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15180314736038305300.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/CTLFireability11994602133238297514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15180314736038305300.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,14.8601,364676,6755,51,568468,653,1131,1.17282e+06,67,1543,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,14.9073,364676,1,0,568468,653,1565,1.17282e+06,76,1543,1681
FORMULA BusinessProcesses-PT-19-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-22 00:40:56] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:40:56] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:40:56] [INFO ] Applying decomposition
[2024-05-22 00:40:56] [INFO ] Flatten gal took : 19 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/graph2658296584359564118.txt' '-o' '/tmp/graph2658296584359564118.bin' '-w' '/tmp/graph2658296584359564118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2658296584359564118.bin' '-l' '-1' '-v' '-w' '/tmp/graph2658296584359564118.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:56] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:56] [INFO ] Removed a total of 292 redundant transitions.
[2024-05-22 00:40:56] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-22 00:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10779820023607098595.gal : 25 ms
[2024-05-22 00:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10444592051071411860.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/CTLFireability10779820023607098595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10444592051071411860.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6548e+33,2.14436,56592,5166,71,101942,855,1433,190271,78,3224,0


Converting to forward existential form...Done !
original formula: EF((AG(((i18.i1.u202.p703==0) + EG((i18.i0.u170.p708==0)))) * E((AX(A((i10.i0.u36.p93==1) U (i17.i0.u91.p269==1))) + (i18.i0.u171.p565!=1...360
=> equivalent forward existential formula: [(FwdU(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(((i18.i1.u202.p703==0) + EG((i18.i0.u170.p708==0))))))),(!(EX(!(!((E...501
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t316, t328, t336, t344, t425, t498, t503, t505, t507, t508, t510, i0.i0.t254...1993
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,1059.27,3216112,1,0,4.27571e+06,855,3868,8.32222e+06,166,3224,3297109
FORMULA BusinessProcesses-PT-19-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-22 01:06:53] [INFO ] Applying decomposition
[2024-05-22 01:06:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:06:53] [INFO ] Decomposing Gal with order
[2024-05-22 01:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:06:53] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 01:06:53] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:06:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 126 ms.
[2024-05-22 01:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1697904174951667076.gal : 72 ms
[2024-05-22 01:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16034891609677857621.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/CTLFireability1697904174951667076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16034891609677857621.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 4 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 01:13:33] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:13:33] [INFO ] Input system was already deterministic with 536 transitions.
[2024-05-22 01:13:33] [INFO ] Transformed 615 places.
[2024-05-22 01:13:33] [INFO ] Transformed 536 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 01:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6324318921363372459.gal : 5 ms
[2024-05-22 01:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3308956015702640442.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/CTLFireability6324318921363372459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3308956015702640442.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-19"
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-19, 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-171620399800594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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