Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r070-smll-174854076300128.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Dekker-PT-100, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076300128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.9M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748647972222

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-30 23:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:32:55] [INFO ] Load time of PNML (sax parser for PT used): 1025 ms
[2025-05-30 23:32:55] [INFO ] Transformed 500 places.
[2025-05-30 23:32:56] [INFO ] Transformed 10200 transitions.
[2025-05-30 23:32:56] [INFO ] Found NUPN structural information;
[2025-05-30 23:32:56] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1363 ms.
RANDOM walk for 40000 steps (8 resets) in 5313 ms. (7 steps per ms) remains 100/500 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 100/100 properties
[2025-05-30 23:32:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2025-05-30 23:32:58] [INFO ] Computed 300 invariants in 24 ms
[2025-05-30 23:32:58] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 300/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 300/600 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 100/500 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 100/800 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 3.0 4.0))
(s1 (/ 1.0 4.0))
(s2 (/ 3.0 4.0))
(s3 (/ 1.0 4.0))
(s4 (/ 3.0 4.0))
(s5 (/ 1.0 4.0))
(s6 (/ 3.0 4.0))
(s7 (/ 1.0 4.0))
(s8 (/ 3.0 4.0))
(s9 (/ 1.0 4.0))
(s10 (/ 3.0 4.0))
(s11 (/ 1.0 4.0))
(s12 (/ 3.0 4.0))
(s13 (/ 1.0 4.0))
(s14 (/ 3.0 4.0))
(s15 (/ 1.0 4.0))
(s16 (/ 3.0 4.0))
(s17 (/ 1.0 4.0))
(s18 (/ 3.0 4.0))
(s19 (/ 1.0 4.0))
(s20 (/ 3.0 4.0))
(s21 (/ 1.0 4.0))
(s22 (/ 3.0 4.0))
(s23 (/ 1.0 4.0))
(s24 (/ 3.0 4.0))
(s25 (/ 1.0 4.0))
(s26 (/ 3.0 4.0))
(s27 (/ 1.0 4.0))
(s28 (/ 3.0 4.0))
(s29 (/ 1.0 4.0))
(s30 (/ 3.0 4.0))
(s31 (/ 1.0 4.0))
(s32 (/ 3.0 4.0))
(s33 (/ 1.0 4.0))
(s34 (/ 3.0 4.0))
(s35 (/ 1.0 4.0))
(s36 (/ 3.0 4.0))
(s37 (/ 1.0 4.0))
(s38 (/ 3.0 4.0))
(s39 (/ 1.0 4.0))
(s40 (/ 3.0 4.0))
(s41 (/ 1.0 4.0))
(s42 (/ 3.0 4.0))
(s43 (/ 1.0 4.0))
(s44 (/ 3.0 4.0))
(s45 (/ 1.0 4.0))
(s46 (/ 3.0 4.0))
(s47 (/ 1.0 4.0))
(s48 (/ 3.0 4.0))
(s49 (/ 1.0 4.0))
(s50 (/ 3.0 4.0))
(s51 (/ 1.0 4.0))
(s52 (/ 3.0 4.0))
(s53 (/ 1.0 4.0))
(s54 (/ 3.0 4.0))
(s55 (/ 1.0 4.0))
(s56 (/ 3.0 4.0))
(s57 (/ 1.0 4.0))
(s58 (/ 3.0 4.0))
(s59 (/ 1.0 4.0))
(s60 (/ 3.0 4.0))
(s61 (/ 1.0 4.0))
(s62 (/ 3.0 4.0))
(s63 (/ 1.0 4.0))
(s64 (/ 3.0 4.0))
(s65 (/ 1.0 4.0))
(s66 (/ 3.0 4.0))
(s67 (/ 1.0 4.0))
(s68 (/ 3.0 4.0))
(s69 (/ 1.0 4.0))
(s70 (/ 3.0 4.0))
(s71 (/ 1.0 4.0))
(s72 (/ 3.0 4.0))
(s73 (/ 1.0 4.0))
(s74 (/ 3.0 4.0))
(s75 (/ 1.0 4.0))
(s76 (/ 3.0 4.0))
(s77 (/ 1.0 4.0))
(s78 (/ 3.0 4.0))
(s79 (/ 1.0 4.0))
(s80 (/ 3.0 4.0))
(s81 (/ 1.0 4.0))
(s82 (/ 3.0 4.0))
(s83 (/ 1.0 4.0))
(s84 (/ 3.0 4.0))
(s85 (/ 1.0 4.0))
(s86 (/ 3.0 4.0))
(s87 (/ 1.0 4.0))
(s88 (/ 3.0 4.0))
(s89 (/ 1.0 4.0))
(s90 (/ 3.0 4.0))
(s91 (/ 1.0 4.0))
(s92 (/ 3.0 4.0))
(s93 (/ 1.0 4.0))
(s94 (/ 3.0 4.0))
(s95 (/ 1.0 4.0))
(s96 (/ 3.0 4.0))
(s97 (/ 1.0 4.0))
(s98 (/ 3.0 4.0))
(s99 (/ 1.0 4.0))
(s100 (/ 3.0 4.0))
(s101 (/ 1.0 4.0))
(s102 (/ 3.0 4.0))
(s103 (/ 1.0 4.0))
(s104 (/ 3.0 4.0))
(s105 (/ 1.0 4.0))
(s106 (/ 3.0 4.0))
(s107 (/ 1.0 4.0))
(s108 (/ 3.0 4.0))
(s109 (/ 1.0 4.0))
(s110 (/ 3.0 4.0))
(s111 (/ 1.0 4.0))
(s112 (/ 3.0 4.0))
(s113 (/ 1.0 4.0))
(s114 (/ 3.0 4.0))
(s115 (/ 1.0 4.0))
(s116 (/ 3.0 4.0))
(s117 (/ 1.0 4.0))
(s118 (/ 3.0 4.0))
(s119 (/ 1.0 4.0))
(s120 (/ 3.0 4.0))
(s121 (/ 1.0 4.0))
(s122 (/ 3.0 4.0))
(s123 (/ 1.0 4.0))
(s124 (/ 3.0 4.0))
(s125 (/ 1.0 4.0))
(s126 (/ 3.0 4.0))
(s127 (/ 1.0 4.0))
(s128 (/ 3.0 4.0))
(s129 (/ 1.0 4.0))
(s130 (/ 3.0 4.0))
(s131 (/ 1.0 4.0))
(s132 (/ 3.0 4.0))
(s133 (/ 1.0 4.0))
(s134 (/ 3.0 4.0))
(s135 (/ 1.0 4.0))
(s136 (/ 3.0 4.0))
(s137 (/ 1.0 4.0))
(s138 (/ 3.0 4.0))
(s139 (/ 1.0 4.0))
(s140 (/ 3.0 4.0))
(s141 (/ 1.0 4.0))
(s142 (/ 3.0 4.0))
(s143 (/ 1.0 4.0))
(s144 (/ 3.0 4.0))
(s145 (/ 1.0 4.0))
(s146 (/ 3.0 4.0))
(s147 (/ 1.0 4.0))
(s148 (/ 3.0 4.0))
(s149 (/ 1.0 4.0))
(s150 (/ 3.0 4.0))
(s151 (/ 1.0 4.0))
(s152 (/ 3.0 4.0))
(s153 (/ 1.0 4.0))
(s154 (/ 3.0 4.0))
(s155 (/ 1.0 4.0))
(s156 (/ 3.0 4.0))
(s157 (/ 1.0 4.0))
(s158 (/ 3.0 4.0))
(s159 (/ 1.0 4.0))
(s160 (/ 3.0 4.0))
(s161 (/ 1.0 4.0))
(s162 (/ 3.0 4.0))
(s163 (/ 1.0 4.0))
(s164 (/ 3.0 4.0))
(s165 (/ 1.0 4.0))
(s166 (/ 3.0 4.0))
(s167 (/ 1.0 4.0))
(s168 (/ 3.0 4.0))
(s169 (/ 1.0 4.0))
(s170 (/ 3.0 4.0))
(s171 (/ 1.0 4.0))
(s172 (/ 3.0 4.0))
(s173 (/ 1.0 4.0))
(s174 (/ 3.0 4.0))
(s175 (/ 1.0 4.0))
(s176 (/ 3.0 4.0))
(s177 (/ 1.0 4.0))
(s178 (/ 3.0 4.0))
(s179 (/ 1.0 4.0))
(s180 (/ 3.0 4.0))
(s181 (/ 1.0 4.0))
(s182 (/ 3.0 4.0))
(s183 (/ 1.0 4.0))
(s184 (/ 3.0 4.0))
(s185 (/ 1.0 4.0))
(s186 (/ 3.0 4.0))
(s187 (/ 1.0 4.0))
(s188 (/ 3.0 4.0))
(s189 (/ 1.0 4.0))
(s190 (/ 3.0 4.0))
(s191 (/ 1.0 4.0))
(s192 (/ 3.0 4.0))
(s193 (/ 1.0 4.0))
(s194 (/ 3.0 4.0))
(s195 (/ 1.0 4.0))
(s196 (/ 3.0 4.0))
(s197 (/ 1.0 4.0))
(s198 (/ 3.0 4.0))
(s199 (/ 1.0 4.0))
(s200 (/ 3.0 4.0))
(s201 0.0)
(s202 (/ 1.0 4.0))
(s203 (/ 3.0 4.0))
(s204 0.0)
(s205 (/ 1.0 4.0))
(s206 (/ 3.0 4.0))
(s207 0.0)
(s208 (/ 1.0 4.0))
(s209 (/ 3.0 4.0))
(s210 0.0)
(s211 (/ 1.0 4.0))
(s212 (/ 3.0 4.0))
(s213 0.0)
(s214 (/ 1.0 4.0))
(s215 (/ 3.0 4.0))
(s216 0.0)
(s217 (/ 1.0 4.0))
(s218 (/ 3.0 4.0))
(s219 0.0)
(s220 (/ 1.0 4.0))
(s221 (/ 3.0 4.0))
(s222 0.0)
(s223 (/ 1.0 4.0))
(s224 (/ 3.0 4.0))
(s225 0.0)
(s226 (/ 1.0 4.0))
(s227 (/ 3.0 4.0))
(s228 0.0)
(s229 (/ 1.0 4.0))
(s230 (/ 3.0 4.0))
(s231 0.0)
(s232 (/ 1.0 4.0))
(s233 (/ 3.0 4.0))
(s234 0.0)
(s235 (/ 1.0 4.0))
(s236 (/ 3.0 4.0))
(s237 0.0)
(s238 (/ 1.0 4.0))
(s239 (/ 3.0 4.0))
(s240 0.0)
(s241 (/ 1.0 4.0))
(s242 (/ 3.0 4.0))
(s243 0.0)
(s244 (/ 1.0 4.0))
(s245 (/ 3.0 4.0))
(s246 0.0)
(s247 (/ 1.0 4.0))
(s248 (/ 3.0 4.0))
(s249 0.0)
(s250 (/ 1.0 4.0))
(s251 (/ 3.0 4.0))
(s252 0.0)
(s253 (/ 1.0 4.0))
(s254 (/ 3.0 4.0))
(s255 0.0)
(s256 (/ 1.0 4.0))
(s257 (/ 3.0 4.0))
(s258 0.0)
(s259 (/ 1.0 4.0))
(s260 (/ 3.0 4.0))
(s261 0.0)
(s262 (/ 1.0 4.0))
(s263 (/ 3.0 4.0))
(s264 0.0)
(s265 (/ 1.0 4.0))
(s266 (/ 3.0 4.0))
(s267 0.0)
(s268 (/ 1.0 4.0))
(s269 (/ 3.0 4.0))
(s270 0.0)
(s271 (/ 1.0 4.0))
(s272 (/ 3.0 4.0))
(s273 0.0)
(s274 (/ 1.0 4.0))
(s275 (/ 3.0 4.0))
(s276 0.0)
(s277 (/ 1.0 4.0))
(s278 (/ 3.0 4.0))
(s279 0.0)
(s280 (/ 1.0 4.0))
(s281 (/ 3.0 4.0))
(s282 0.0)
(s283 (/ 1.0 4.0))
(s284 (/ 3.0 4.0))
(s285 0.0)
(s286 (/ 1.0 4.0))
(s287 (/ 3.0 4.0))
(s288 0.0)
(s289 (/ 1.0 4.0))
(s290 (/ 3.0 4.0))
(s291 0.0)
(s292 (/ 1.0 4.0))
(s293 (/ 3.0 4.0))
(s294 0.0)
(s295 (/ 1.0 4.0))
(s296 (/ 3.0 4.0))
(s297 0.0)
(s298 (/ 1.0 4.0))
(s299 (/ 3.0 4.0))
(s300 0.0)
(s301 (/ 1.0 4.0))
(s302 (/ 3.0 4.0))
(s303 0.0)
(s304 (/ 1.0 4.0))
(s305 (/ 3.0 4.0))
(s306 0.0)
(s307 (/ 1.0 4.0))
(s308 (/ 3.0 4.0))
(s309 0.0)
(s310 (/ 1.0 4.0))
(s311 (/ 3.0 4.0))
(s312 0.0)
(s313 (/ 1.0 4.0))
(s314 (/ 3.0 4.0))
(s315 0.0)
(s316 (/ 1.0 4.0))
(s317 (/ 3.0 4.0))
(s318 0.0)
(s319 (/ 1.0 4.0))
(s320 (/ 3.0 4.0))
(s321 0.0)
(s322 (/ 1.0 4.0))
(s323 (/ 3.0 4.0))
(s324 0.0)
(s325 (/ 1.0 4.0))
(s326 (/ 3.0 4.0))
(s327 0.0)
(s328 (/ 1.0 4.0))
(s329 (/ 3.0 4.0))
(s330 0.0)
(s331 (/ 1.0 4.0))
(s332 (/ 3.0 4.0))
(s333 0.0)
(s334 (/ 1.0 4.0))
(s335 (/ 3.0 4.0))
(s336 0.0)
(s337 (/ 1.0 4.0))
(s338 (/ 3.0 4.0))
(s339 0.0)
(s340 (/ 1.0 4.0))
(s341 (/ 3.0 4.0))
(s342 0.0)
(s343 (/ 1.0 4.0))
(s344 (/ 3.0 4.0))
(s345 0.0)
(s346 (/ 1.0 4.0))
(s347 (/ 3.0 4.0))
(s348 0.0)
(s349 (/ 1.0 4.0))
(s350 (/ 3.0 4.0))
(s351 0.0)
(s352 (/ 1.0 4.0))
(s353 (/ 3.0 4.0))
(s354 0.0)
(s355 (/ 1.0 4.0))
(s356 (/ 3.0 4.0))
(s357 0.0)
(s358 (/ 1.0 4.0))
(s359 (/ 3.0 4.0))
(s360 0.0)
(s361 (/ 1.0 4.0))
(s362 (/ 3.0 4.0))
(s363 0.0)
(s364 (/ 1.0 4.0))
(s365 (/ 3.0 4.0))
(s366 0.0)
(s367 (/ 1.0 4.0))
(s368 (/ 3.0 4.0))
(s369 0.0)
(s370 (/ 1.0 4.0))
(s371 (/ 3.0 4.0))
(s372 0.0)
(s373 (/ 1.0 4.0))
(s374 (/ 3.0 4.0))
(s375 0.0)
(s376 (/ 1.0 4.0))
(s377 (/ 3.0 4.0))
(s378 0.0)
(s379 (/ 1.0 4.0))
(s380 (/ 3.0 4.0))
(s381 0.0)
(s382 (/ 1.0 4.0))
(s383 (/ 3.0 4.0))
(s384 0.0)
(s385 (/ 1.0 4.0))
(s386 (/ 3.0 4.0))
(s387 0.0)
(s388 (/ 1.0 4.0))
(s389 (/ 3.0 4.0))
(s390 0.0)
(s391 (/ 1.0 4.0))
(s392 (/ 3.0 4.0))
(s393 0.0)
(s394 (/ 1.0 4.0))
(s395 (/ 3.0 4.0))
(s396 0.0)
(s397 (/ 1.0 4.0))
(s398 (/ 3.0 4.0))
(s399 0.0)
(s400 (/ 1.0 4.0))
(s401 (/ 3.0 4.0))
(s402 0.0)
(s403 (/ 1.0 4.0))
(s404 (/ 3.0 4.0))
(s405 0.0)
(s406 (/ 1.0 4.0))
(s407 (/ 3.0 4.0))
(s408 0.0)
(s409 (/ 1.0 4.0))
(s410 (/ 3.0 4.0))
(s411 0.0)
(s412 (/ 1.0 4.0))
(s413 (/ 3.0 4.0))
(s414 0.0)
(s415 (/ 1.0 4.0))
(s416 (/ 3.0 4.0))
(s417 0.0)
(s418 (/ 1.0 4.0))
(s419 (/ 3.0 4.0))
(s420 0.0)
(s421 (/ 1.0 4.0))
(s422 (/ 3.0 4.0))
(s423 0.0)
(s424 (/ 1.0 4.0))
(s425 (/ 3.0 4.0))
(s426 0.0)
(s427 (/ 1.0 4.0))
(s428 (/ 3.0 4.0))
(s429 0.0)
(s430 (/ 1.0 4.0))
(s431 (/ 3.0 4.0))
(s432 0.0)
(s433 (/ 1.0 4.0))
(s434 (/ 3.0 4.0))
(s435 0.0)
(s436 (/ 1.0 4.0))
(s437 (/ 3.0 4.0))
(s438 0.0)
(s439 (/ 1.0 4.0))
(s440 (/ 3.0 4.0))
(s441 0.0)
(s442 (/ 1.0 4.0))
(s443 (/ 3.0 4.0))
(s444 0.0)
(s445 (/ 1.0 4.0))
(s446 (/ 3.0 4.0))
(s447 0.0)
(s448 (/ 1.0 4.0))
(s449 (/ 3.0 4.0))
(s450 0.0)
(s451 (/ 1.0 4.0))
(s452 (/ 3.0 4.0))
(s453 0.0)
(s454 (/ 1.0 4.0))
(s455 (/ 3.0 4.0))
(s456 0.0)
(s457 (/ 1.0 4.0))
(s458 (/ 3.0 4.0))
(s459 0.0)
(s460 (/ 1.0 4.0))
(s461 (/ 3.0 4.0))
(s462 0.0)
(s463 (/ 1.0 4.0))
(s464 (/ 3.0 4.0))
(s465 0.0)
(s466 (/ 1.0 4.0))
(s467 (/ 3.0 4.0))
(s468 0.0)
(s469 (/ 1.0 4.0))
(s470 (/ 3.0 4.0))
(s471 0.0)
(s472 (/ 1.0 4.0))
(s473 (/ 3.0 4.0))
(s474 0.0)
(s475 (/ 1.0 4.0))
(s476 (/ 3.0 4.0))
(s477 0.0)
(s478 (/ 1.0 4.0))
(s479 (/ 3.0 4.0))
(s480 0.0)
(s481 (/ 1.0 4.0))
(s482 (/ 3.0 4.0))
(s483 0.0)
(s484 (/ 1.0 4.0))
(s485 (/ 3.0 4.0))
(s486 0.0)
(s487 (/ 1.0 4.0))
(s488 (/ 3.0 4.0))
(s489 0.0)
(s490 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/900 variables, and 800 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5092 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 0/500 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 300/400 variables, 200/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 300/600 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2025-05-30 23:33:05] [INFO ] Deduced a trap composed of 4 places in 1304 ms of which 49 ms to minimize.
[2025-05-30 23:33:07] [INFO ] Deduced a trap composed of 4 places in 1301 ms of which 5 ms to minimize.
[2025-05-30 23:33:08] [INFO ] Deduced a trap composed of 4 places in 1313 ms of which 5 ms to minimize.
SMT process timed out in 10497ms, After SMT, problems are : Problem set: 0 solved, 100 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1305 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1327 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 2590652 steps (4 resets) in 120008 ms. (21 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 98/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 97/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 96/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 95/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 94/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 92/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 92/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 91/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 91/91 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 91/91 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 91/91 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 90/91 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 90/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 89/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 88/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 87/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 86/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 84/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 84/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 83/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 83/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 82/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 82/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 82/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 82/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 82/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 81/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 80/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 80/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 79/80 properties
[2025-05-30 23:33:45] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 23:33:45] [INFO ] Invariant cache hit.
[2025-05-30 23:33:45] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 237/316 variables, 158/237 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 237/474 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 79/395 variables, 79/553 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 79/632 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 316/711 variables, 395/1027 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/711 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 42/753 variables, 100/1127 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 126/879 variables, 84/1211 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/879 variables, 84/1295 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/879 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (OVERLAPS) 21/900 variables, 42/1337 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 21/1358 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/900 variables, 21/1379 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 21/1400 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 20 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 79 unsolved in 17827 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 237/316 variables, 158/237 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 237/474 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-30 23:34:04] [INFO ] Deduced a trap composed of 4 places in 935 ms of which 3 ms to minimize.
[2025-05-30 23:34:05] [INFO ] Deduced a trap composed of 4 places in 1099 ms of which 4 ms to minimize.
[2025-05-30 23:34:06] [INFO ] Deduced a trap composed of 4 places in 886 ms of which 4 ms to minimize.
[2025-05-30 23:34:07] [INFO ] Deduced a trap composed of 4 places in 856 ms of which 4 ms to minimize.
[2025-05-30 23:34:08] [INFO ] Deduced a trap composed of 4 places in 1074 ms of which 4 ms to minimize.
[2025-05-30 23:34:09] [INFO ] Deduced a trap composed of 4 places in 1220 ms of which 4 ms to minimize.
[2025-05-30 23:34:11] [INFO ] Deduced a trap composed of 4 places in 1146 ms of which 4 ms to minimize.
[2025-05-30 23:34:11] [INFO ] Deduced a trap composed of 4 places in 919 ms of which 4 ms to minimize.
[2025-05-30 23:34:12] [INFO ] Deduced a trap composed of 4 places in 930 ms of which 4 ms to minimize.
[2025-05-30 23:34:13] [INFO ] Deduced a trap composed of 4 places in 909 ms of which 3 ms to minimize.
[2025-05-30 23:34:14] [INFO ] Deduced a trap composed of 4 places in 928 ms of which 4 ms to minimize.
[2025-05-30 23:34:15] [INFO ] Deduced a trap composed of 4 places in 1085 ms of which 3 ms to minimize.
[2025-05-30 23:34:16] [INFO ] Deduced a trap composed of 4 places in 1074 ms of which 5 ms to minimize.
[2025-05-30 23:34:17] [INFO ] Deduced a trap composed of 4 places in 864 ms of which 3 ms to minimize.
[2025-05-30 23:34:18] [INFO ] Deduced a trap composed of 4 places in 886 ms of which 4 ms to minimize.
[2025-05-30 23:34:19] [INFO ] Deduced a trap composed of 4 places in 1025 ms of which 4 ms to minimize.
[2025-05-30 23:34:20] [INFO ] Deduced a trap composed of 4 places in 1056 ms of which 4 ms to minimize.
[2025-05-30 23:34:21] [INFO ] Deduced a trap composed of 4 places in 999 ms of which 3 ms to minimize.
[2025-05-30 23:34:22] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 3 ms to minimize.
[2025-05-30 23:34:23] [INFO ] Deduced a trap composed of 4 places in 879 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-30 23:34:24] [INFO ] Deduced a trap composed of 4 places in 871 ms of which 2 ms to minimize.
[2025-05-30 23:34:25] [INFO ] Deduced a trap composed of 4 places in 848 ms of which 3 ms to minimize.
[2025-05-30 23:34:26] [INFO ] Deduced a trap composed of 4 places in 889 ms of which 4 ms to minimize.
[2025-05-30 23:34:27] [INFO ] Deduced a trap composed of 4 places in 876 ms of which 4 ms to minimize.
[2025-05-30 23:34:28] [INFO ] Deduced a trap composed of 4 places in 1081 ms of which 4 ms to minimize.
[2025-05-30 23:34:29] [INFO ] Deduced a trap composed of 4 places in 1061 ms of which 4 ms to minimize.
[2025-05-30 23:34:30] [INFO ] Deduced a trap composed of 4 places in 812 ms of which 2 ms to minimize.
[2025-05-30 23:34:31] [INFO ] Deduced a trap composed of 4 places in 840 ms of which 4 ms to minimize.
[2025-05-30 23:34:31] [INFO ] Deduced a trap composed of 4 places in 790 ms of which 2 ms to minimize.
[2025-05-30 23:34:32] [INFO ] Deduced a trap composed of 4 places in 872 ms of which 2 ms to minimize.
[2025-05-30 23:34:33] [INFO ] Deduced a trap composed of 4 places in 908 ms of which 2 ms to minimize.
[2025-05-30 23:34:34] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 4 ms to minimize.
[2025-05-30 23:34:35] [INFO ] Deduced a trap composed of 4 places in 912 ms of which 3 ms to minimize.
[2025-05-30 23:34:36] [INFO ] Deduced a trap composed of 4 places in 907 ms of which 2 ms to minimize.
[2025-05-30 23:34:37] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 3 ms to minimize.
[2025-05-30 23:34:37] [INFO ] Deduced a trap composed of 4 places in 729 ms of which 2 ms to minimize.
[2025-05-30 23:34:38] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 3 ms to minimize.
[2025-05-30 23:34:39] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 3 ms to minimize.
[2025-05-30 23:34:40] [INFO ] Deduced a trap composed of 4 places in 729 ms of which 3 ms to minimize.
[2025-05-30 23:34:40] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-05-30 23:34:41] [INFO ] Deduced a trap composed of 4 places in 950 ms of which 4 ms to minimize.
[2025-05-30 23:34:42] [INFO ] Deduced a trap composed of 4 places in 809 ms of which 4 ms to minimize.
[2025-05-30 23:34:43] [INFO ] Deduced a trap composed of 4 places in 931 ms of which 4 ms to minimize.
[2025-05-30 23:34:44] [INFO ] Deduced a trap composed of 4 places in 838 ms of which 4 ms to minimize.
[2025-05-30 23:34:45] [INFO ] Deduced a trap composed of 4 places in 764 ms of which 3 ms to minimize.
[2025-05-30 23:34:46] [INFO ] Deduced a trap composed of 4 places in 872 ms of which 3 ms to minimize.
[2025-05-30 23:34:46] [INFO ] Deduced a trap composed of 4 places in 875 ms of which 4 ms to minimize.
[2025-05-30 23:34:47] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 3 ms to minimize.
[2025-05-30 23:34:48] [INFO ] Deduced a trap composed of 4 places in 714 ms of which 4 ms to minimize.
SMT process timed out in 63235ms, After SMT, problems are : Problem set: 0 solved, 79 unsolved
Fused 79 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 79 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 870 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 870 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 2731361 steps (8 resets) in 120010 ms. (22 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1872 ms. (213 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1873 ms. (213 steps per ms) remains 78/79 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2333 ms. (171 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1865 ms. (214 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2333 ms. (171 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2071 ms. (193 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2157 ms. (185 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2336 ms. (171 steps per ms) remains 77/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1873 ms. (213 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1873 ms. (213 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1859 ms. (215 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1857 ms. (215 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1862 ms. (214 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1872 ms. (213 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1854 ms. (215 steps per ms) remains 77/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1993 ms. (200 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2326 ms. (171 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1867 ms. (214 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1853 ms. (215 steps per ms) remains 75/76 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1865 ms. (214 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1867 ms. (214 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1862 ms. (214 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1868 ms. (214 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1870 ms. (213 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1862 ms. (214 steps per ms) remains 75/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1862 ms. (214 steps per ms) remains 74/75 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1878 ms. (212 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1852 ms. (215 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1864 ms. (214 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1855 ms. (215 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1872 ms. (213 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1864 ms. (214 steps per ms) remains 72/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1870 ms. (213 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1854 ms. (215 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1863 ms. (214 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1861 ms. (214 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1854 ms. (215 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1857 ms. (215 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1859 ms. (215 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2016 ms. (198 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2070 ms. (193 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1974 ms. (202 steps per ms) remains 70/72 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1852 ms. (215 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1863 ms. (214 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1858 ms. (215 steps per ms) remains 69/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1857 ms. (215 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1859 ms. (215 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1858 ms. (215 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1856 ms. (215 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1853 ms. (215 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1871 ms. (213 steps per ms) remains 69/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1860 ms. (214 steps per ms) remains 67/69 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1875 ms. (213 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1869 ms. (213 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1870 ms. (213 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1856 ms. (215 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1875 ms. (213 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1861 ms. (214 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1865 ms. (214 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1863 ms. (214 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1867 ms. (214 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1866 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1859 ms. (215 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1859 ms. (215 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1867 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1856 ms. (215 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1864 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1864 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1862 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1858 ms. (215 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1865 ms. (214 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1864 ms. (214 steps per ms) remains 64/64 properties
[2025-05-30 23:35:56] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 23:35:56] [INFO ] Invariant cache hit.
[2025-05-30 23:35:56] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 192/256 variables, 128/192 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 192/384 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 64/320 variables, 64/448 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 64/512 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 256/576 variables, 320/832 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 72/648 variables, 100/932 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 216/864 variables, 144/1076 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/864 variables, 144/1220 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/1220 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 15 (OVERLAPS) 36/900 variables, 72/1292 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 36/1328 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/900 variables, 36/1364 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 36/1400 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 20 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 64 unsolved in 11530 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 192/256 variables, 128/192 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 192/384 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:36:09] [INFO ] Deduced a trap composed of 4 places in 1050 ms of which 4 ms to minimize.
[2025-05-30 23:36:10] [INFO ] Deduced a trap composed of 4 places in 977 ms of which 3 ms to minimize.
[2025-05-30 23:36:11] [INFO ] Deduced a trap composed of 4 places in 869 ms of which 3 ms to minimize.
[2025-05-30 23:36:12] [INFO ] Deduced a trap composed of 4 places in 843 ms of which 4 ms to minimize.
[2025-05-30 23:36:13] [INFO ] Deduced a trap composed of 4 places in 798 ms of which 3 ms to minimize.
[2025-05-30 23:36:14] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 3 ms to minimize.
[2025-05-30 23:36:14] [INFO ] Deduced a trap composed of 4 places in 910 ms of which 3 ms to minimize.
[2025-05-30 23:36:15] [INFO ] Deduced a trap composed of 4 places in 889 ms of which 3 ms to minimize.
[2025-05-30 23:36:16] [INFO ] Deduced a trap composed of 4 places in 849 ms of which 3 ms to minimize.
[2025-05-30 23:36:17] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 2 ms to minimize.
[2025-05-30 23:36:18] [INFO ] Deduced a trap composed of 4 places in 846 ms of which 3 ms to minimize.
[2025-05-30 23:36:19] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 3 ms to minimize.
[2025-05-30 23:36:19] [INFO ] Deduced a trap composed of 4 places in 708 ms of which 2 ms to minimize.
[2025-05-30 23:36:20] [INFO ] Deduced a trap composed of 4 places in 821 ms of which 4 ms to minimize.
[2025-05-30 23:36:21] [INFO ] Deduced a trap composed of 4 places in 816 ms of which 3 ms to minimize.
[2025-05-30 23:36:22] [INFO ] Deduced a trap composed of 4 places in 816 ms of which 3 ms to minimize.
[2025-05-30 23:36:23] [INFO ] Deduced a trap composed of 4 places in 769 ms of which 3 ms to minimize.
[2025-05-30 23:36:23] [INFO ] Deduced a trap composed of 4 places in 761 ms of which 3 ms to minimize.
[2025-05-30 23:36:24] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 3 ms to minimize.
[2025-05-30 23:36:25] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:36:26] [INFO ] Deduced a trap composed of 4 places in 799 ms of which 3 ms to minimize.
[2025-05-30 23:36:26] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 2 ms to minimize.
[2025-05-30 23:36:27] [INFO ] Deduced a trap composed of 4 places in 739 ms of which 2 ms to minimize.
[2025-05-30 23:36:28] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 3 ms to minimize.
[2025-05-30 23:36:29] [INFO ] Deduced a trap composed of 4 places in 710 ms of which 3 ms to minimize.
[2025-05-30 23:36:29] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 3 ms to minimize.
[2025-05-30 23:36:30] [INFO ] Deduced a trap composed of 4 places in 690 ms of which 2 ms to minimize.
[2025-05-30 23:36:31] [INFO ] Deduced a trap composed of 4 places in 650 ms of which 2 ms to minimize.
[2025-05-30 23:36:31] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 3 ms to minimize.
[2025-05-30 23:36:32] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 3 ms to minimize.
[2025-05-30 23:36:33] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 3 ms to minimize.
[2025-05-30 23:36:33] [INFO ] Deduced a trap composed of 4 places in 650 ms of which 3 ms to minimize.
[2025-05-30 23:36:34] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 2 ms to minimize.
[2025-05-30 23:36:35] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 2 ms to minimize.
[2025-05-30 23:36:35] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 2 ms to minimize.
[2025-05-30 23:36:36] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 2 ms to minimize.
[2025-05-30 23:36:36] [INFO ] Deduced a trap composed of 4 places in 573 ms of which 3 ms to minimize.
[2025-05-30 23:36:37] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 3 ms to minimize.
[2025-05-30 23:36:37] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 2 ms to minimize.
[2025-05-30 23:36:38] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:36:39] [INFO ] Deduced a trap composed of 4 places in 709 ms of which 3 ms to minimize.
[2025-05-30 23:36:40] [INFO ] Deduced a trap composed of 4 places in 689 ms of which 3 ms to minimize.
[2025-05-30 23:36:40] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 2 ms to minimize.
[2025-05-30 23:36:41] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 2 ms to minimize.
[2025-05-30 23:36:41] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 2 ms to minimize.
[2025-05-30 23:36:42] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 2 ms to minimize.
[2025-05-30 23:36:43] [INFO ] Deduced a trap composed of 4 places in 541 ms of which 2 ms to minimize.
[2025-05-30 23:36:43] [INFO ] Deduced a trap composed of 4 places in 656 ms of which 2 ms to minimize.
[2025-05-30 23:36:44] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 2 ms to minimize.
[2025-05-30 23:36:44] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 3 ms to minimize.
[2025-05-30 23:36:45] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 2 ms to minimize.
[2025-05-30 23:36:45] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 3 ms to minimize.
[2025-05-30 23:36:46] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 2 ms to minimize.
[2025-05-30 23:36:47] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 2 ms to minimize.
[2025-05-30 23:36:47] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 2 ms to minimize.
[2025-05-30 23:36:48] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 2 ms to minimize.
[2025-05-30 23:36:48] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 2 ms to minimize.
[2025-05-30 23:36:48] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 2 ms to minimize.
[2025-05-30 23:36:49] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 2 ms to minimize.
[2025-05-30 23:36:49] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:36:50] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2025-05-30 23:36:50] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2025-05-30 23:36:51] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 2 ms to minimize.
[2025-05-30 23:36:51] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 2 ms to minimize.
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 2 ms to minimize.
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 2 ms to minimize.
[2025-05-30 23:36:53] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 3 ms to minimize.
[2025-05-30 23:36:53] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 2 ms to minimize.
[2025-05-30 23:36:54] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 2 ms to minimize.
[2025-05-30 23:36:54] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 2 ms to minimize.
[2025-05-30 23:36:54] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 2 ms to minimize.
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 2 ms to minimize.
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 2 ms to minimize.
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 2 ms to minimize.
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 2 ms to minimize.
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 2 ms to minimize.
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 2 ms to minimize.
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 2 ms to minimize.
[2025-05-30 23:36:58] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 2 ms to minimize.
[2025-05-30 23:36:58] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:36:59] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 2 ms to minimize.
[2025-05-30 23:36:59] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 2 ms to minimize.
[2025-05-30 23:37:00] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 2 ms to minimize.
[2025-05-30 23:37:00] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 3 ms to minimize.
[2025-05-30 23:37:01] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 2 ms to minimize.
[2025-05-30 23:37:01] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 2 ms to minimize.
[2025-05-30 23:37:01] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 2 ms to minimize.
[2025-05-30 23:37:02] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 2 ms to minimize.
[2025-05-30 23:37:02] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 2 ms to minimize.
[2025-05-30 23:37:03] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 3 ms to minimize.
[2025-05-30 23:37:03] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 2 ms to minimize.
[2025-05-30 23:37:04] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 2 ms to minimize.
[2025-05-30 23:37:04] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 2 ms to minimize.
[2025-05-30 23:37:04] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2025-05-30 23:37:05] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2025-05-30 23:37:05] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 2 ms to minimize.
[2025-05-30 23:37:05] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2025-05-30 23:37:06] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2025-05-30 23:37:06] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2025-05-30 23:37:06] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:37:07] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 2 ms to minimize.
[2025-05-30 23:37:07] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 2 ms to minimize.
[2025-05-30 23:37:07] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 2 ms to minimize.
[2025-05-30 23:37:08] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2025-05-30 23:37:08] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2025-05-30 23:37:08] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 2 ms to minimize.
[2025-05-30 23:37:09] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2025-05-30 23:37:09] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 2 ms to minimize.
[2025-05-30 23:37:09] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 2 ms to minimize.
[2025-05-30 23:37:10] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2025-05-30 23:37:10] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 2 ms to minimize.
[2025-05-30 23:37:11] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 2 ms to minimize.
[2025-05-30 23:37:11] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 2 ms to minimize.
[2025-05-30 23:37:11] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 2 ms to minimize.
[2025-05-30 23:37:12] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 2 ms to minimize.
[2025-05-30 23:37:12] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 2 ms to minimize.
[2025-05-30 23:37:12] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 2 ms to minimize.
[2025-05-30 23:37:13] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 2 ms to minimize.
[2025-05-30 23:37:13] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2025-05-30 23:37:13] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:37:14] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 2 ms to minimize.
[2025-05-30 23:37:14] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 2 ms to minimize.
[2025-05-30 23:37:15] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 2 ms to minimize.
[2025-05-30 23:37:15] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 2 ms to minimize.
[2025-05-30 23:37:15] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 2 ms to minimize.
[2025-05-30 23:37:16] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 2 ms to minimize.
[2025-05-30 23:37:16] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 2 ms to minimize.
[2025-05-30 23:37:16] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2025-05-30 23:37:17] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 2 ms to minimize.
[2025-05-30 23:37:17] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2025-05-30 23:37:17] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:37:17] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2025-05-30 23:37:17] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 2 ms to minimize.
[2025-05-30 23:37:18] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2025-05-30 23:37:18] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 2 ms to minimize.
[2025-05-30 23:37:18] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 2 ms to minimize.
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 20/524 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:37:19] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:37:20] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 2 ms to minimize.
[2025-05-30 23:37:20] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2025-05-30 23:37:20] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2025-05-30 23:37:20] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2025-05-30 23:37:20] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 2 ms to minimize.
[2025-05-30 23:37:21] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2025-05-30 23:37:21] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 2 ms to minimize.
[2025-05-30 23:37:21] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2025-05-30 23:37:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:37:22] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2025-05-30 23:37:22] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 2 ms to minimize.
[2025-05-30 23:37:22] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 2 ms to minimize.
[2025-05-30 23:37:23] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 2 ms to minimize.
[2025-05-30 23:37:23] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 2 ms to minimize.
SMT process timed out in 86854ms, After SMT, problems are : Problem set: 0 solved, 64 unsolved
Fused 64 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 817 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 818 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 2423820 steps (6 resets) in 120004 ms. (20 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2712 ms. (147 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2736 ms. (146 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2713 ms. (147 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1920 ms. (208 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2102 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3016 ms. (132 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2763 ms. (144 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2747 ms. (145 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2634 ms. (151 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1965 ms. (203 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2693 ms. (148 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2907 ms. (137 steps per ms) remains 61/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2759 ms. (144 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3055 ms. (130 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2950 ms. (135 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3136 ms. (127 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2877 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2770 ms. (144 steps per ms) remains 61/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2963 ms. (134 steps per ms) remains 60/61 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2774 ms. (144 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2785 ms. (143 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2491 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2755 ms. (145 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2197 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2830 ms. (141 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2181 ms. (183 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2699 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2371 ms. (168 steps per ms) remains 57/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2125 ms. (188 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2945 ms. (135 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3053 ms. (130 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2505 ms. (159 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2298 ms. (173 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2581 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2247 ms. (177 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2563 ms. (156 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2122 ms. (188 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2421 ms. (165 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2123 ms. (188 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2164 ms. (184 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2149 ms. (186 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2366 ms. (168 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2213 ms. (180 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2270 ms. (176 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2322 ms. (172 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2201 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2150 ms. (185 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2830 ms. (141 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1983 ms. (201 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2138 ms. (187 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2312 ms. (172 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2086 ms. (191 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2422 ms. (165 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1996 ms. (200 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2060 ms. (194 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2395 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2116 ms. (188 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2443 ms. (163 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1976 ms. (202 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2069 ms. (193 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2704 ms. (147 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2127 ms. (187 steps per ms) remains 49/49 properties
[2025-05-30 23:38:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 23:38:39] [INFO ] Invariant cache hit.
[2025-05-30 23:38:39] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 147/196 variables, 98/147 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 147/294 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 49/245 variables, 49/343 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 49/392 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 196/441 variables, 245/637 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 102/543 variables, 100/737 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 306/849 variables, 204/941 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 204/1145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 51/900 variables, 102/1247 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 51/1298 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/900 variables, 51/1349 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 51/1400 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 20 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 49 unsolved in 6504 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 147/196 variables, 98/147 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 147/294 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:38:46] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 3 ms to minimize.
[2025-05-30 23:38:47] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 3 ms to minimize.
[2025-05-30 23:38:48] [INFO ] Deduced a trap composed of 4 places in 789 ms of which 3 ms to minimize.
[2025-05-30 23:38:49] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 3 ms to minimize.
[2025-05-30 23:38:49] [INFO ] Deduced a trap composed of 4 places in 755 ms of which 2 ms to minimize.
[2025-05-30 23:38:50] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 3 ms to minimize.
[2025-05-30 23:38:51] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 2 ms to minimize.
[2025-05-30 23:38:51] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 2 ms to minimize.
[2025-05-30 23:38:52] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 3 ms to minimize.
[2025-05-30 23:38:53] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 3 ms to minimize.
[2025-05-30 23:38:53] [INFO ] Deduced a trap composed of 4 places in 640 ms of which 2 ms to minimize.
[2025-05-30 23:38:54] [INFO ] Deduced a trap composed of 6 places in 621 ms of which 3 ms to minimize.
[2025-05-30 23:38:55] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 2 ms to minimize.
[2025-05-30 23:38:55] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 2 ms to minimize.
[2025-05-30 23:38:56] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 2 ms to minimize.
[2025-05-30 23:38:56] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 2 ms to minimize.
[2025-05-30 23:38:57] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 2 ms to minimize.
[2025-05-30 23:38:57] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 2 ms to minimize.
[2025-05-30 23:38:57] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 3 ms to minimize.
[2025-05-30 23:38:58] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:38:59] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 2 ms to minimize.
[2025-05-30 23:38:59] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 3 ms to minimize.
[2025-05-30 23:39:00] [INFO ] Deduced a trap composed of 4 places in 530 ms of which 3 ms to minimize.
[2025-05-30 23:39:00] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 2 ms to minimize.
[2025-05-30 23:39:01] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 2 ms to minimize.
[2025-05-30 23:39:01] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 2 ms to minimize.
[2025-05-30 23:39:02] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 2 ms to minimize.
[2025-05-30 23:39:02] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 2 ms to minimize.
[2025-05-30 23:39:03] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 3 ms to minimize.
[2025-05-30 23:39:03] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 2 ms to minimize.
[2025-05-30 23:39:03] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 2 ms to minimize.
[2025-05-30 23:39:04] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 2 ms to minimize.
[2025-05-30 23:39:04] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 3 ms to minimize.
[2025-05-30 23:39:05] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2025-05-30 23:39:05] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2025-05-30 23:39:06] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 2 ms to minimize.
[2025-05-30 23:39:06] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 2 ms to minimize.
[2025-05-30 23:39:06] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 2 ms to minimize.
[2025-05-30 23:39:07] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 2 ms to minimize.
[2025-05-30 23:39:07] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:08] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 3 ms to minimize.
[2025-05-30 23:39:08] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 3 ms to minimize.
[2025-05-30 23:39:09] [INFO ] Deduced a trap composed of 4 places in 539 ms of which 2 ms to minimize.
[2025-05-30 23:39:09] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 2 ms to minimize.
[2025-05-30 23:39:10] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 2 ms to minimize.
[2025-05-30 23:39:10] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 2 ms to minimize.
[2025-05-30 23:39:11] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 3 ms to minimize.
[2025-05-30 23:39:11] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 2 ms to minimize.
[2025-05-30 23:39:12] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 2 ms to minimize.
[2025-05-30 23:39:12] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 2 ms to minimize.
[2025-05-30 23:39:13] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 2 ms to minimize.
[2025-05-30 23:39:13] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 2 ms to minimize.
[2025-05-30 23:39:13] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2025-05-30 23:39:14] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2025-05-30 23:39:14] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2025-05-30 23:39:15] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 2 ms to minimize.
[2025-05-30 23:39:15] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2025-05-30 23:39:15] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 2 ms to minimize.
[2025-05-30 23:39:16] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2025-05-30 23:39:16] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:16] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 2 ms to minimize.
[2025-05-30 23:39:17] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 2 ms to minimize.
[2025-05-30 23:39:17] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 2 ms to minimize.
[2025-05-30 23:39:17] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 2 ms to minimize.
[2025-05-30 23:39:18] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2025-05-30 23:39:18] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2025-05-30 23:39:18] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 2 ms to minimize.
[2025-05-30 23:39:18] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 2 ms to minimize.
[2025-05-30 23:39:19] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2025-05-30 23:39:19] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2025-05-30 23:39:19] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 2 ms to minimize.
[2025-05-30 23:39:19] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 2 ms to minimize.
[2025-05-30 23:39:20] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2025-05-30 23:39:20] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2025-05-30 23:39:20] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2025-05-30 23:39:20] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2025-05-30 23:39:21] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 2 ms to minimize.
[2025-05-30 23:39:21] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2025-05-30 23:39:21] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2025-05-30 23:39:21] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:21] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2025-05-30 23:39:22] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2025-05-30 23:39:22] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2025-05-30 23:39:22] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2025-05-30 23:39:22] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 2 ms to minimize.
[2025-05-30 23:39:23] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 2 ms to minimize.
[2025-05-30 23:39:23] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 2 ms to minimize.
[2025-05-30 23:39:23] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2025-05-30 23:39:23] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2025-05-30 23:39:24] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 2 ms to minimize.
[2025-05-30 23:39:24] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 4 ms to minimize.
[2025-05-30 23:39:24] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2025-05-30 23:39:24] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 2 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2025-05-30 23:39:25] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:39:26] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:39:27] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:28] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:39:29] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 2 ms to minimize.
[2025-05-30 23:39:30] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:39:31] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 2 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 2 ms to minimize.
[2025-05-30 23:39:32] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2025-05-30 23:39:33] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 20/454 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:39:34] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:39:35] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 20/474 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:36] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 2 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 2 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:39:44] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 20/534 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:39:45] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:39:46] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 20/554 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:39:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:39:48] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 2 ms to minimize.
[2025-05-30 23:39:48] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2025-05-30 23:39:48] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 2 ms to minimize.
[2025-05-30 23:39:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2025-05-30 23:39:48] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 2 ms to minimize.
[2025-05-30 23:39:49] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 2 ms to minimize.
[2025-05-30 23:39:49] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 2 ms to minimize.
[2025-05-30 23:39:49] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:39:49] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 2 ms to minimize.
[2025-05-30 23:39:49] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2025-05-30 23:39:50] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:39:50] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 20/574 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:50] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 2 ms to minimize.
[2025-05-30 23:39:50] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2025-05-30 23:39:51] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2025-05-30 23:39:51] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 2 ms to minimize.
[2025-05-30 23:39:51] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2025-05-30 23:39:51] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2025-05-30 23:39:51] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 2 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 2 ms to minimize.
[2025-05-30 23:39:52] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2025-05-30 23:39:53] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2025-05-30 23:39:53] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:39:53] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 2 ms to minimize.
[2025-05-30 23:39:53] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2025-05-30 23:39:54] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2025-05-30 23:39:54] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2025-05-30 23:39:54] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 20/594 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:54] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2025-05-30 23:39:54] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2025-05-30 23:39:55] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2025-05-30 23:39:55] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 3 ms to minimize.
[2025-05-30 23:39:55] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2025-05-30 23:39:55] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2025-05-30 23:39:55] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 2 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:39:56] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/196 variables, 20/614 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2025-05-30 23:39:58] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/196 variables, 20/634 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:39:59] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2025-05-30 23:40:00] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/196 variables, 20/654 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:40:02] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:40:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/196 variables, 20/674 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2025-05-30 23:40:04] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 2 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 2 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:40:05] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:40:06] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:40:07] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:40:07] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/196 variables, 20/694 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:40:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:07] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:40:08] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/196 variables, 20/714 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:40:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:40:12] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/196 variables, 18/732 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/196 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 27 (OVERLAPS) 49/245 variables, 49/781 constraints. Problems are: Problem set: 0 solved, 49 unsolved
SMT process timed out in 96627ms, After SMT, problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 538 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 2642640 steps (6 resets) in 120004 ms. (22 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2931 ms. (136 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3137 ms. (127 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2886 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2905 ms. (137 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2901 ms. (137 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2866 ms. (139 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2918 ms. (137 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2894 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2871 ms. (139 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3274 ms. (122 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3075 ms. (130 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2570 ms. (155 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2208 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2511 ms. (159 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2268 ms. (176 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2504 ms. (159 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2257 ms. (177 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2550 ms. (156 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2050 ms. (195 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2001 ms. (199 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2324 ms. (172 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2204 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2095 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2761 ms. (144 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2359 ms. (169 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1968 ms. (203 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2001 ms. (199 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2238 ms. (178 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2415 ms. (165 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2791 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2385 ms. (167 steps per ms) remains 43/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2123 ms. (188 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2084 ms. (191 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2618 ms. (152 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2809 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2758 ms. (144 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2712 ms. (147 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1943 ms. (205 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2501 ms. (159 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2762 ms. (144 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2797 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2757 ms. (145 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1972 ms. (202 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2036 ms. (196 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2001 ms. (199 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1956 ms. (204 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1949 ms. (205 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1954 ms. (204 steps per ms) remains 41/42 properties
[2025-05-30 23:41:22] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 23:41:22] [INFO ] Invariant cache hit.
[2025-05-30 23:41:22] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 123/164 variables, 82/123 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 123/246 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 41/205 variables, 41/287 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 41/328 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 164/369 variables, 205/533 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 118/487 variables, 100/633 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 354/841 variables, 236/869 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/841 variables, 236/1105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/841 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 59/900 variables, 118/1223 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 59/1282 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/900 variables, 59/1341 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 59/1400 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 20 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 41 unsolved in 4680 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 123/164 variables, 82/123 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 123/246 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:27] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 2 ms to minimize.
[2025-05-30 23:41:28] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 2 ms to minimize.
[2025-05-30 23:41:28] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 3 ms to minimize.
[2025-05-30 23:41:29] [INFO ] Deduced a trap composed of 6 places in 495 ms of which 2 ms to minimize.
[2025-05-30 23:41:29] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 2 ms to minimize.
[2025-05-30 23:41:30] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2025-05-30 23:41:30] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 2 ms to minimize.
[2025-05-30 23:41:30] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 2 ms to minimize.
[2025-05-30 23:41:31] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 2 ms to minimize.
[2025-05-30 23:41:31] [INFO ] Deduced a trap composed of 4 places in 430 ms of which 2 ms to minimize.
[2025-05-30 23:41:32] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 2 ms to minimize.
[2025-05-30 23:41:32] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 2 ms to minimize.
[2025-05-30 23:41:32] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2025-05-30 23:41:33] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2025-05-30 23:41:33] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 2 ms to minimize.
[2025-05-30 23:41:34] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 2 ms to minimize.
[2025-05-30 23:41:34] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 2 ms to minimize.
[2025-05-30 23:41:34] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 2 ms to minimize.
[2025-05-30 23:41:34] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 2 ms to minimize.
[2025-05-30 23:41:35] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:35] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 2 ms to minimize.
[2025-05-30 23:41:35] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2025-05-30 23:41:36] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 2 ms to minimize.
[2025-05-30 23:41:36] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 2 ms to minimize.
[2025-05-30 23:41:36] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 2 ms to minimize.
[2025-05-30 23:41:37] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2025-05-30 23:41:37] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 2 ms to minimize.
[2025-05-30 23:41:37] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2025-05-30 23:41:37] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2025-05-30 23:41:38] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 2 ms to minimize.
[2025-05-30 23:41:38] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2025-05-30 23:41:38] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2025-05-30 23:41:38] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2025-05-30 23:41:39] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2025-05-30 23:41:39] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 2 ms to minimize.
[2025-05-30 23:41:39] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2025-05-30 23:41:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2025-05-30 23:41:39] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2025-05-30 23:41:40] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2025-05-30 23:41:40] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/286 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:40] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2025-05-30 23:41:40] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2025-05-30 23:41:40] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2025-05-30 23:41:41] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 2 ms to minimize.
[2025-05-30 23:41:41] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2025-05-30 23:41:41] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2025-05-30 23:41:41] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2025-05-30 23:41:41] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:41:42] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:43] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2025-05-30 23:41:44] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2025-05-30 23:41:44] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2025-05-30 23:41:44] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2025-05-30 23:41:44] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2025-05-30 23:41:44] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:41:45] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2025-05-30 23:41:46] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:41:48] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2025-05-30 23:41:49] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:41:50] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:41:51] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:52] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:41:53] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:41:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:41:55] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:41:56] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 2 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2025-05-30 23:41:57] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2025-05-30 23:41:58] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 20/426 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:41:59] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:42:00] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2025-05-30 23:42:02] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 20/466 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:42:03] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:04] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 2 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2025-05-30 23:42:05] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 5 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:06] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:07] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2025-05-30 23:42:08] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 20/526 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:10] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:42:12] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/164 variables, 20/566 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:42:13] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:14] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/164 variables, 20/586 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2025-05-30 23:42:15] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/164 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:42:17] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:18] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/164 variables, 20/626 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:42:20] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/164 variables, 20/646 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:42:21] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2025-05-30 23:42:22] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/164 variables, 20/666 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:23] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:42:24] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/164 variables, 20/686 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:42:25] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:26] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/164 variables, 20/706 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2025-05-30 23:42:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/164 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/164 variables, 20/766 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:33] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:34] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2025-05-30 23:42:35] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:42:35] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2025-05-30 23:42:35] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/164 variables, 20/786 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:38] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2025-05-30 23:42:38] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:42:38] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:38] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2025-05-30 23:42:38] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/164 variables, 20/806 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:39] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2025-05-30 23:42:39] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:42:39] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2025-05-30 23:42:39] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:42:39] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/164 variables, 20/826 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:41] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2025-05-30 23:42:42] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/164 variables, 20/846 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:42:43] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:42:44] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/164 variables, 20/866 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2025-05-30 23:42:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:46] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/164 variables, 20/886 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:47] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2025-05-30 23:42:47] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:47] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:42:47] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:42:47] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/164 variables, 20/906 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:42:49] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:42:50] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:42:51] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:42:51] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2025-05-30 23:42:51] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:42:51] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:42:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/164 variables, 20/926 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:42:52] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2025-05-30 23:42:53] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/164 variables, 20/946 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:42:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:42:55] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:42:56] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2025-05-30 23:42:56] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/164 variables, 20/966 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:56] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 2 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2025-05-30 23:42:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2025-05-30 23:42:58] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/164 variables, 20/986 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:42:59] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:43:00] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:43:01] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/164 variables, 20/1006 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2025-05-30 23:43:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:03] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/164 variables, 20/1026 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:43:05] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:43:06] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:43:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/164 variables, 20/1046 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:43:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/164 variables, 20/1066 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/164 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 46 (OVERLAPS) 41/205 variables, 41/1107 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/205 variables, 41/1148 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 205/900 variables, and 1148 constraints, problems are : Problem set: 0 solved, 41 unsolved in 105012 ms.
Refiners :[Domain max(s): 205/500 constraints, Positive P Invariants (semi-flows): 82/200 constraints, Generalized P Invariants (flows): 41/100 constraints, State Equation: 0/500 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/41 constraints, Known Traps: 820/820 constraints]
After SMT, in 109794ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 503 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 500/500 places, 10200/10200 transitions.
RANDOM walk for 2436881 steps (6 resets) in 120004 ms. (20 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2642 ms. (151 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2701 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2684 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2681 ms. (149 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2671 ms. (149 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2713 ms. (147 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2666 ms. (149 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2704 ms. (147 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2678 ms. (149 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2759 ms. (144 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2690 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2689 ms. (148 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2667 ms. (149 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2711 ms. (147 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2665 ms. (150 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2732 ms. (146 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2814 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2771 ms. (144 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2712 ms. (147 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2792 ms. (143 steps per ms) remains 36/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2690 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2779 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2744 ms. (145 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2722 ms. (146 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2735 ms. (146 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2758 ms. (144 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2722 ms. (146 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2761 ms. (144 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2702 ms. (147 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2736 ms. (146 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2710 ms. (147 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2723 ms. (146 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2823 ms. (141 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2709 ms. (147 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2703 ms. (147 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3004 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2753 ms. (145 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2731 ms. (146 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2722 ms. (146 steps per ms) remains 34/34 properties
[2025-05-30 23:44:18] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2025-05-30 23:44:18] [INFO ] Invariant cache hit.
[2025-05-30 23:44:18] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 102/136 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 102/204 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 34/170 variables, 34/238 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 34/272 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 136/306 variables, 170/442 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 132/438 variables, 100/542 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 396/834 variables, 264/806 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/834 variables, 264/1070 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 66/900 variables, 132/1202 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 66/1268 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/900 variables, 66/1334 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/900 variables, 66/1400 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 0/900 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 1400 constraints, problems are : Problem set: 0 solved, 34 unsolved in 4036 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 102/136 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 102/204 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:22] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 2 ms to minimize.
[2025-05-30 23:44:23] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 2 ms to minimize.
[2025-05-30 23:44:23] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 1 ms to minimize.
[2025-05-30 23:44:23] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 2 ms to minimize.
[2025-05-30 23:44:24] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 2 ms to minimize.
[2025-05-30 23:44:24] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2025-05-30 23:44:24] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2025-05-30 23:44:25] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2025-05-30 23:44:25] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 2 ms to minimize.
[2025-05-30 23:44:25] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2025-05-30 23:44:26] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 2 ms to minimize.
[2025-05-30 23:44:26] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 2 ms to minimize.
[2025-05-30 23:44:26] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 2 ms to minimize.
[2025-05-30 23:44:27] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2025-05-30 23:44:27] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2025-05-30 23:44:27] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2025-05-30 23:44:27] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2025-05-30 23:44:28] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2025-05-30 23:44:28] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2025-05-30 23:44:28] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:28] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 2 ms to minimize.
[2025-05-30 23:44:29] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2025-05-30 23:44:29] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 2 ms to minimize.
[2025-05-30 23:44:29] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2025-05-30 23:44:29] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2025-05-30 23:44:30] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 2 ms to minimize.
[2025-05-30 23:44:30] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2025-05-30 23:44:30] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2025-05-30 23:44:30] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 2 ms to minimize.
[2025-05-30 23:44:31] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2025-05-30 23:44:31] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2025-05-30 23:44:31] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2025-05-30 23:44:31] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2025-05-30 23:44:31] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2025-05-30 23:44:32] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 2 ms to minimize.
[2025-05-30 23:44:32] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2025-05-30 23:44:32] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:44:32] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2025-05-30 23:44:32] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2025-05-30 23:44:33] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:33] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2025-05-30 23:44:33] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2025-05-30 23:44:33] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2025-05-30 23:44:33] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 2 ms to minimize.
[2025-05-30 23:44:34] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2025-05-30 23:44:34] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 2 ms to minimize.
[2025-05-30 23:44:34] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 2 ms to minimize.
[2025-05-30 23:44:34] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2025-05-30 23:44:34] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 2 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2025-05-30 23:44:35] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:36] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 2 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:44:37] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:38] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:44:39] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 2 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2025-05-30 23:44:40] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:44:41] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 2 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2025-05-30 23:44:42] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 2 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:43] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:44] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:46] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:44:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:44:48] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:44:49] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/136 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2025-05-30 23:44:51] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:44:52] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:44:54] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-05-30 23:44:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:44:56] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:44:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:44:58] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/136 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:44:59] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2025-05-30 23:45:00] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 2 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:45:01] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/136 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 2 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:02] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:45:03] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/136 variables, 20/524 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-05-30 23:45:04] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:05] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/136 variables, 20/544 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:06] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/136 variables, 20/564 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2025-05-30 23:45:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:45:08] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/136 variables, 20/584 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:45:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:10] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/136 variables, 20/604 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/136 variables, 20/624 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:45:13] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/136 variables, 20/644 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/136 variables, 20/664 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 20/684 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:45:19] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2025-05-30 23:45:20] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2025-05-30 23:45:21] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/136 variables, 20/724 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:23] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:23] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2025-05-30 23:45:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:45:23] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:45:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:45:24] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2025-05-30 23:45:25] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-05-30 23:45:25] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2025-05-30 23:45:25] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2025-05-30 23:45:25] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2025-05-30 23:45:25] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 20/744 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2025-05-30 23:45:26] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:45:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/136 variables, 20/764 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-30 23:45:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/136 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/136 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 34 (OVERLAPS) 34/170 variables, 34/799 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/170 variables, 34/833 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/170 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 37 (OVERLAPS) 136/306 variables, 170/1003 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/306 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 39 (OVERLAPS) 132/438 variables, 100/1103 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/438 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 41 (OVERLAPS) 396/834 variables, 264/1367 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/834 variables, 264/1631 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/834 variables, 34/1665 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/834 variables, 0/1665 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 45 (OVERLAPS) 66/900 variables, 132/1797 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/900 variables, 66/1863 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/900 variables, 66/1929 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/900 variables, 66/1995 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/900 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 50 (OVERLAPS) 0/900 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 1995 constraints, problems are : Problem set: 0 solved, 34 unsolved in 80298 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 561/561 constraints]
After SMT, in 84453ms problems are : Problem set: 0 solved, 34 unsolved
Finished Parikh walk after 138 steps, including 1 resets, run visited all 34 properties in 43 ms. (steps per millisecond=3 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 34 properties in 191 ms.
Able to resolve query StableMarking after proving 500 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 768069 ms.
ITS solved all properties within timeout

BK_STOP 1748648742820

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="Dekker-PT-100"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is Dekker-PT-100, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-174854076300128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-100.tgz
mv Dekker-PT-100 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;