Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762000858.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000858
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 625K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717271146134

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:45:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:45:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:45:47] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-06-01 19:45:47] [INFO ] Transformed 2003 places.
[2024-06-01 19:45:47] [INFO ] Transformed 2253 transitions.
[2024-06-01 19:45:47] [INFO ] Found NUPN structural information;
[2024-06-01 19:45:47] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 105 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 328 places :
Symmetric choice reduction at 0 with 328 rule applications. Total rules 328 place count 1675 transition count 1925
Iterating global reduction 0 with 328 rules applied. Total rules applied 656 place count 1675 transition count 1925
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 657 place count 1674 transition count 1924
Iterating global reduction 0 with 1 rules applied. Total rules applied 658 place count 1674 transition count 1924
Applied a total of 658 rules in 494 ms. Remains 1674 /2003 variables (removed 329) and now considering 1924/2253 (removed 329) transitions.
// Phase 1: matrix 1924 rows 1674 cols
[2024-06-01 19:45:48] [INFO ] Computed 201 invariants in 36 ms
[2024-06-01 19:45:48] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-06-01 19:45:48] [INFO ] Invariant cache hit.
[2024-06-01 19:45:50] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
Running 1923 sub problems to find dead transitions.
[2024-06-01 19:45:50] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1673/3598 variables, and 0 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1674 constraints, PredecessorRefiner: 1923/1923 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1923 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1673/3598 variables, and 0 constraints, problems are : Problem set: 0 solved, 1923 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1674 constraints, PredecessorRefiner: 0/1923 constraints, Known Traps: 0/0 constraints]
After SMT, in 60762ms problems are : Problem set: 0 solved, 1923 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Starting structural reductions in LTL mode, iteration 1 : 1674/2003 places, 1924/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63590 ms. Remains : 1674/2003 places, 1924/2253 transitions.
Support contains 105 out of 1674 places after structural reductions.
[2024-06-01 19:46:51] [INFO ] Flatten gal took : 168 ms
[2024-06-01 19:46:51] [INFO ] Flatten gal took : 100 ms
[2024-06-01 19:46:51] [INFO ] Input system was already deterministic with 1924 transitions.
RANDOM walk for 40000 steps (16 resets) in 1675 ms. (23 steps per ms) remains 8/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
[2024-06-01 19:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 245/265 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1409/1674 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 19:46:53] [INFO ] Deduced a trap composed of 41 places in 369 ms of which 48 ms to minimize.
[2024-06-01 19:46:54] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 6 ms to minimize.
[2024-06-01 19:46:54] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 5 ms to minimize.
[2024-06-01 19:46:54] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 5 ms to minimize.
[2024-06-01 19:46:55] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 5 ms to minimize.
[2024-06-01 19:46:55] [INFO ] Deduced a trap composed of 22 places in 292 ms of which 7 ms to minimize.
[2024-06-01 19:46:55] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 5 ms to minimize.
[2024-06-01 19:46:56] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 5 ms to minimize.
[2024-06-01 19:46:56] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 5 ms to minimize.
[2024-06-01 19:46:56] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 5 ms to minimize.
[2024-06-01 19:46:57] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 5 ms to minimize.
[2024-06-01 19:46:57] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 6 ms to minimize.
[2024-06-01 19:46:57] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 5 ms to minimize.
[2024-06-01 19:46:58] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 5 ms to minimize.
SMT process timed out in 5072ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1674 transition count 1727
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1477 transition count 1727
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 394 place count 1477 transition count 1476
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 896 place count 1226 transition count 1476
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 915 place count 1207 transition count 1457
Iterating global reduction 2 with 19 rules applied. Total rules applied 934 place count 1207 transition count 1457
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 934 place count 1207 transition count 1445
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 958 place count 1195 transition count 1445
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 2 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 2 with 958 rules applied. Total rules applied 1916 place count 716 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 2 with 100 rules applied. Total rules applied 2016 place count 716 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2017 place count 715 transition count 965
Applied a total of 2017 rules in 512 ms. Remains 715 /1674 variables (removed 959) and now considering 965/1924 (removed 959) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 715/1674 places, 965/1924 transitions.
RANDOM walk for 40000 steps (66 resets) in 560 ms. (71 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
// Phase 1: matrix 965 rows 715 cols
[2024-06-01 19:46:58] [INFO ] Computed 201 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/69 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/204 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/213 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/215 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 128/343 variables, 50/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/343 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/351 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/351 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/351 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 124/475 variables, 48/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/475 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/475 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/483 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/483 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/483 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 125/608 variables, 48/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/608 variables, 11/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/608 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 9/617 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/617 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/617 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 116/733 variables, 48/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/733 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 8/741 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/741 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/741 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 66/807 variables, 28/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/807 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/807 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/807 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 4/811 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/811 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/811 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 62/873 variables, 24/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/873 variables, 6/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/873 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/877 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/877 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/877 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 60/937 variables, 24/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/937 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/937 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 6/943 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/943 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/943 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 66/1009 variables, 27/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1009 variables, 6/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:46:59] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1009 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1009 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/1013 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1013 variables, 4/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1013 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 62/1075 variables, 24/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1075 variables, 6/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1075 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 4/1079 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1079 variables, 4/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1079 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 62/1141 variables, 24/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1141 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1141 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1145 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1145 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1145 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 61/1206 variables, 24/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1206 variables, 6/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1206 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 5/1211 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1211 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1211 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 64/1275 variables, 26/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1275 variables, 6/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1275 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 4/1279 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1279 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1279 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 62/1341 variables, 24/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1341 variables, 6/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1341 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 4/1345 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1345 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1345 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 64/1409 variables, 25/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1409 variables, 6/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1409 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/1413 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1413 variables, 4/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1413 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 60/1473 variables, 24/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1473 variables, 5/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1473 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 6/1479 variables, 3/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1479 variables, 3/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 108 (INCLUDED_ONLY) 0/1479 variables, 5/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1479 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 66/1545 variables, 27/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1545 variables, 6/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1545 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 4/1549 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1549 variables, 4/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1549 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 45/1594 variables, 21/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1594 variables, 6/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:00] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:47:01] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 118 (INCLUDED_ONLY) 0/1594 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1594 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 2/1596 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1596 variables, 2/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1596 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 31/1627 variables, 12/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1627 variables, 3/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1627 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 2/1629 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1629 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1629 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 31/1660 variables, 12/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1660 variables, 3/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1660 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/1662 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1662 variables, 2/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1662 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 18/1680 variables, 12/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1680 variables, 4/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:01] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 137 (INCLUDED_ONLY) 0/1680 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1680 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 0/1680 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1680/1680 variables, and 930 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 715/715 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/69 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/204 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/213 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 9/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/215 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 128/343 variables, 50/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/343 variables, 12/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/351 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/351 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/351 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/351 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 124/475 variables, 48/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/475 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/475 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 8/483 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/483 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/483 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 125/608 variables, 48/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/608 variables, 11/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/608 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 9/617 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/617 variables, 9/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/617 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 116/733 variables, 48/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/741 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/741 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/741 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 66/807 variables, 28/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/807 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/807 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:01] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/807 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/807 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/811 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/811 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/811 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 62/873 variables, 24/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/873 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/873 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/873 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/877 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/877 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/877 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 60/937 variables, 24/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/937 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/937 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/937 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 6/943 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/943 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/943 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 66/1009 variables, 27/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1009 variables, 6/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1009 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 4 ms to minimize.
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1009 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1009 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 4/1013 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1013 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1013 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 62/1075 variables, 24/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1075 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/1075 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1075 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 4/1079 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1079 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1079 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 62/1141 variables, 24/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1141 variables, 6/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/1141 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1141 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 4/1145 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1145 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1145 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 61/1206 variables, 24/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1206 variables, 6/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:47:02] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/1206 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1206 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 5/1211 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1211 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1211 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 64/1275 variables, 26/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1275 variables, 6/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1275 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 4/1279 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1279 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1279 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 62/1341 variables, 24/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1341 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1341 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 4/1345 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1345 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1345 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 64/1409 variables, 25/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1409 variables, 6/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1409 variables, 3/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1409 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 4/1413 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1413 variables, 4/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1413 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 60/1473 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1473 variables, 5/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1473 variables, 2/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1473 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 6/1479 variables, 3/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1479 variables, 3/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1479 variables, 5/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1479 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 66/1545 variables, 27/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1545 variables, 6/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1545 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1545 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 4/1549 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1549 variables, 4/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1549 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 45/1594 variables, 21/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1594 variables, 6/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1594 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:47:03] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 130 (INCLUDED_ONLY) 0/1594 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1594 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/1596 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1596 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1596 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 31/1627 variables, 12/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1627 variables, 3/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:04] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 137 (INCLUDED_ONLY) 0/1627 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1627 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 2/1629 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1629 variables, 2/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1629 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 31/1660 variables, 12/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1660 variables, 3/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1660 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 2/1662 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1662 variables, 2/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1662 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 18/1680 variables, 12/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1680 variables, 4/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1680 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1680 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 0/1680 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 950 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2698 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 715/715 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints]
After SMT, in 5339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 347 ms.
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 965/965 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 715 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 713 transition count 963
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 706 transition count 956
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 706 transition count 956
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 705 transition count 955
Applied a total of 21 rules in 270 ms. Remains 705 /715 variables (removed 10) and now considering 955/965 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 705/715 places, 955/965 transitions.
RANDOM walk for 40000 steps (68 resets) in 392 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 285627 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 285627 steps, saw 170603 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 955 rows 705 cols
[2024-06-01 19:47:08] [INFO ] Computed 201 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/69 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/201 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/207 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 130/337 variables, 52/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/345 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 124/469 variables, 48/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/469 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/469 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/477 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/477 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/477 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 124/601 variables, 48/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/601 variables, 12/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/601 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 8/609 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/609 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/609 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 116/725 variables, 48/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/725 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/725 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 8/733 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/733 variables, 8/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/733 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 66/799 variables, 28/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/799 variables, 8/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/799 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/803 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/803 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/803 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 62/865 variables, 24/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/865 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/865 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/869 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/869 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/869 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 62/931 variables, 24/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/931 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/931 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 4/935 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/935 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/935 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/997 variables, 24/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/997 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/997 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/1001 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1001 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1001 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 62/1063 variables, 24/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1063 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1063 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 4/1067 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1067 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1067 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 62/1129 variables, 24/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1129 variables, 6/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1129 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/1133 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1133 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1133 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 62/1195 variables, 24/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1195 variables, 6/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1195 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 4/1199 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1199 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1199 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 62/1261 variables, 24/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1261 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1261 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 4/1265 variables, 2/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1265 variables, 4/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1265 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 62/1327 variables, 24/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1327 variables, 6/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1327 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 4/1331 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1331 variables, 4/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1331 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 62/1393 variables, 24/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1393 variables, 6/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1393 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 4/1397 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1397 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1397 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 62/1459 variables, 24/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1459 variables, 6/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1459 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 4/1463 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1463 variables, 4/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1463 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 62/1525 variables, 24/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1525 variables, 6/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1525 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 4/1529 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1529 variables, 4/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1529 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 45/1574 variables, 21/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1574 variables, 6/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1574 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 2/1576 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1576 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1576 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 31/1607 variables, 12/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1607 variables, 3/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1607 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 2/1609 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1609 variables, 2/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1609 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 31/1640 variables, 12/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1640 variables, 3/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1640 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 2/1642 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1642 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1642 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 18/1660 variables, 12/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1660 variables, 4/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 0/1660 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1660/1660 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/69 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/201 variables, 48/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/207 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 130/337 variables, 52/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 13/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:09] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/345 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/345 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 124/469 variables, 48/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/469 variables, 12/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/469 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/477 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/477 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/477 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 124/601 variables, 48/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/601 variables, 12/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/601 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 8/609 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/609 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/609 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 116/725 variables, 48/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/725 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/725 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 8/733 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/733 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 66/799 variables, 28/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/799 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:09] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:47:09] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/799 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/799 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 4/803 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/803 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/803 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 62/865 variables, 24/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/865 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/865 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/869 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/869 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/869 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 62/931 variables, 24/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/931 variables, 6/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/931 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/935 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/935 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/935 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 62/997 variables, 24/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/997 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/997 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 4/1001 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1001 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1001 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 62/1063 variables, 24/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1063 variables, 6/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1063 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 4/1067 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1067 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1067 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 62/1129 variables, 24/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1129 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:09] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1129 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1129 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 4/1133 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1133 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1133 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 62/1195 variables, 24/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1195 variables, 6/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1195 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 4/1199 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1199 variables, 4/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1199 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 62/1261 variables, 24/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1261 variables, 6/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:09] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 83 (INCLUDED_ONLY) 0/1261 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1261 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 4/1265 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1265 variables, 4/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1265 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 62/1327 variables, 24/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1327 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1327 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 4/1331 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1331 variables, 4/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1331 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 62/1393 variables, 24/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1393 variables, 6/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1393 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 4/1397 variables, 2/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1397 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1397 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 62/1459 variables, 24/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1459 variables, 6/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1459 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 4/1463 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1463 variables, 4/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1463 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 62/1525 variables, 24/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1525 variables, 6/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1525 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 4/1529 variables, 2/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1529 variables, 4/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1529 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 45/1574 variables, 21/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1574 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:10] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1574 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1574 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 2/1576 variables, 1/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1576 variables, 2/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1576 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 31/1607 variables, 12/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1607 variables, 3/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:10] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 121 (INCLUDED_ONLY) 0/1607 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1607 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/1609 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1609 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1609 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 31/1640 variables, 12/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1640 variables, 3/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:10] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
At refinement iteration 128 (INCLUDED_ONLY) 0/1640 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1640 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/1642 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1642 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1642 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 18/1660 variables, 12/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1660 variables, 4/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:47:10] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 5 ms to minimize.
At refinement iteration 135 (INCLUDED_ONLY) 0/1660 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1660 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 0/1660 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1660/1660 variables, and 916 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 705/705 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 316 ms.
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 22 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 705/705 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 955/955 transitions.
Applied a total of 0 rules in 20 ms. Remains 705 /705 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2024-06-01 19:47:11] [INFO ] Invariant cache hit.
[2024-06-01 19:47:11] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 19:47:11] [INFO ] Invariant cache hit.
[2024-06-01 19:47:12] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2024-06-01 19:47:12] [INFO ] Redundant transitions in 133 ms returned []
Running 952 sub problems to find dead transitions.
[2024-06-01 19:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:47:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:47:23] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 19:47:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:47:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:47:25] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:47:25] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:47:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:47:26] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:47:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:47:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:47:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:47:27] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:47:37] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:47:38] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:47:39] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:47:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:47:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1660 variables, and 295 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 96/295 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:47:43] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:47:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:47:45] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:47:46] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 19:47:47] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:47:47] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:47:47] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:47:47] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:47:47] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:47:48] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:47:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:47:48] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:47:48] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:47:49] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:47:51] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:47:52] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:47:53] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:47:54] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:55] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2024-06-01 19:47:55] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:47:55] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:47:56] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 5 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:47:57] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:47:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:47:59] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:48:00] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:48:01] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:48:01] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:48:01] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:48:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:48:02] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:48:03] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:48:04] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:48:05] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:48:05] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:48:05] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:48:05] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:48:05] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:48:06] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:48:07] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:48:07] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:48:07] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:48:08] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:48:09] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:48:10] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2024-06-01 19:48:10] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:48:10] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:48:10] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2024-06-01 19:48:11] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:48:11] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:48:12] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:48:12] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:48:12] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1660 variables, and 460 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 261/261 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61571 ms. Remains : 705/705 places, 955/955 transitions.
[2024-06-01 19:48:12] [INFO ] Flatten gal took : 73 ms
[2024-06-01 19:48:12] [INFO ] Flatten gal took : 66 ms
[2024-06-01 19:48:13] [INFO ] Input system was already deterministic with 1924 transitions.
Computed a total of 414 stabilizing places and 414 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1673 transition count 1727
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1477 transition count 1727
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 392 place count 1477 transition count 1476
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 894 place count 1226 transition count 1476
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 916 place count 1204 transition count 1454
Iterating global reduction 2 with 22 rules applied. Total rules applied 938 place count 1204 transition count 1454
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 938 place count 1204 transition count 1440
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 966 place count 1190 transition count 1440
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 478
Deduced a syphon composed of 478 places in 1 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 2 with 956 rules applied. Total rules applied 1922 place count 712 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1924 place count 710 transition count 960
Applied a total of 1924 rules in 208 ms. Remains 710 /1674 variables (removed 964) and now considering 960/1924 (removed 964) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 209 ms. Remains : 710/1674 places, 960/1924 transitions.
[2024-06-01 19:48:13] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:48:13] [INFO ] Flatten gal took : 38 ms
[2024-06-01 19:48:13] [INFO ] Input system was already deterministic with 960 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1673 transition count 1727
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1477 transition count 1727
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 392 place count 1477 transition count 1480
Deduced a syphon composed of 247 places in 2 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 886 place count 1230 transition count 1480
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 904 place count 1212 transition count 1462
Iterating global reduction 2 with 18 rules applied. Total rules applied 922 place count 1212 transition count 1462
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 922 place count 1212 transition count 1453
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 940 place count 1203 transition count 1453
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 1 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 1904 place count 721 transition count 971
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1906 place count 719 transition count 969
Applied a total of 1906 rules in 197 ms. Remains 719 /1674 variables (removed 955) and now considering 969/1924 (removed 955) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 197 ms. Remains : 719/1674 places, 969/1924 transitions.
[2024-06-01 19:48:13] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:48:13] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:48:13] [INFO ] Input system was already deterministic with 969 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1673 transition count 1722
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1472 transition count 1722
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1472 transition count 1472
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1222 transition count 1472
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 924 place count 1200 transition count 1450
Iterating global reduction 2 with 22 rules applied. Total rules applied 946 place count 1200 transition count 1450
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 946 place count 1200 transition count 1436
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 974 place count 1186 transition count 1436
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 483
Deduced a syphon composed of 483 places in 2 ms
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 2 with 966 rules applied. Total rules applied 1940 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1942 place count 701 transition count 951
Applied a total of 1942 rules in 186 ms. Remains 701 /1674 variables (removed 973) and now considering 951/1924 (removed 973) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 186 ms. Remains : 701/1674 places, 951/1924 transitions.
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:48:14] [INFO ] Input system was already deterministic with 951 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1654 transition count 1904
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1654 transition count 1904
Applied a total of 40 rules in 94 ms. Remains 1654 /1674 variables (removed 20) and now considering 1904/1924 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 1654/1674 places, 1904/1924 transitions.
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 52 ms
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 54 ms
[2024-06-01 19:48:14] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1656 transition count 1906
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1656 transition count 1906
Applied a total of 36 rules in 78 ms. Remains 1656 /1674 variables (removed 18) and now considering 1906/1924 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 1656/1674 places, 1906/1924 transitions.
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 50 ms
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 50 ms
[2024-06-01 19:48:14] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1673 transition count 1723
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1473 transition count 1723
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 400 place count 1473 transition count 1472
Deduced a syphon composed of 251 places in 1 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 902 place count 1222 transition count 1472
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 924 place count 1200 transition count 1450
Iterating global reduction 2 with 22 rules applied. Total rules applied 946 place count 1200 transition count 1450
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 946 place count 1200 transition count 1436
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 974 place count 1186 transition count 1436
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 1 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 2 with 962 rules applied. Total rules applied 1936 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1938 place count 703 transition count 953
Applied a total of 1938 rules in 186 ms. Remains 703 /1674 variables (removed 971) and now considering 953/1924 (removed 971) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 703/1674 places, 953/1924 transitions.
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:48:14] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:48:15] [INFO ] Input system was already deterministic with 953 transitions.
RANDOM walk for 25 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-050B-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1653 transition count 1903
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1653 transition count 1903
Applied a total of 42 rules in 89 ms. Remains 1653 /1674 variables (removed 21) and now considering 1903/1924 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 1653/1674 places, 1903/1924 transitions.
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 51 ms
[2024-06-01 19:48:15] [INFO ] Input system was already deterministic with 1903 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1673 transition count 1723
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1473 transition count 1723
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1473 transition count 1474
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1224 transition count 1474
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 920 place count 1202 transition count 1452
Iterating global reduction 2 with 22 rules applied. Total rules applied 942 place count 1202 transition count 1452
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 942 place count 1202 transition count 1438
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 970 place count 1188 transition count 1438
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 483
Deduced a syphon composed of 483 places in 1 ms
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 2 with 966 rules applied. Total rules applied 1936 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1938 place count 703 transition count 953
Applied a total of 1938 rules in 176 ms. Remains 703 /1674 variables (removed 971) and now considering 953/1924 (removed 971) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 176 ms. Remains : 703/1674 places, 953/1924 transitions.
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 24 ms
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:48:15] [INFO ] Input system was already deterministic with 953 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-050B-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1673 transition count 1723
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1473 transition count 1722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1472 transition count 1722
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 402 place count 1472 transition count 1472
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 902 place count 1222 transition count 1472
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 923 place count 1201 transition count 1451
Iterating global reduction 3 with 21 rules applied. Total rules applied 944 place count 1201 transition count 1451
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 944 place count 1201 transition count 1437
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 972 place count 1187 transition count 1437
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 1930 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1932 place count 706 transition count 956
Applied a total of 1932 rules in 187 ms. Remains 706 /1674 variables (removed 968) and now considering 956/1924 (removed 968) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 706/1674 places, 956/1924 transitions.
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:48:15] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:48:15] [INFO ] Input system was already deterministic with 956 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1656 transition count 1906
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1656 transition count 1906
Applied a total of 36 rules in 75 ms. Remains 1656 /1674 variables (removed 18) and now considering 1906/1924 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 1656/1674 places, 1906/1924 transitions.
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 44 ms
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:48:16] [INFO ] Input system was already deterministic with 1906 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1673 transition count 1723
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1473 transition count 1723
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 400 place count 1473 transition count 1473
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 900 place count 1223 transition count 1473
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 922 place count 1201 transition count 1451
Iterating global reduction 2 with 22 rules applied. Total rules applied 944 place count 1201 transition count 1451
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 944 place count 1201 transition count 1437
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 972 place count 1187 transition count 1437
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 1 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 1936 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1938 place count 703 transition count 953
Applied a total of 1938 rules in 168 ms. Remains 703 /1674 variables (removed 971) and now considering 953/1924 (removed 971) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 168 ms. Remains : 703/1674 places, 953/1924 transitions.
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:48:16] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1673 transition count 1722
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1472 transition count 1722
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1472 transition count 1472
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1222 transition count 1472
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 924 place count 1200 transition count 1450
Iterating global reduction 2 with 22 rules applied. Total rules applied 946 place count 1200 transition count 1450
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 946 place count 1200 transition count 1436
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 974 place count 1186 transition count 1436
Performed 483 Post agglomeration using F-continuation condition.Transition count delta: 483
Deduced a syphon composed of 483 places in 1 ms
Reduce places removed 483 places and 0 transitions.
Iterating global reduction 2 with 966 rules applied. Total rules applied 1940 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1942 place count 701 transition count 951
Applied a total of 1942 rules in 187 ms. Remains 701 /1674 variables (removed 973) and now considering 951/1924 (removed 973) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 701/1674 places, 951/1924 transitions.
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:48:16] [INFO ] Input system was already deterministic with 951 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1654 transition count 1904
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1654 transition count 1904
Applied a total of 40 rules in 79 ms. Remains 1654 /1674 variables (removed 20) and now considering 1904/1924 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 1654/1674 places, 1904/1924 transitions.
[2024-06-01 19:48:16] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:48:17] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1654 transition count 1904
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1654 transition count 1904
Applied a total of 40 rules in 77 ms. Remains 1654 /1674 variables (removed 20) and now considering 1904/1924 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 1654/1674 places, 1904/1924 transitions.
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:48:17] [INFO ] Input system was already deterministic with 1904 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1673 transition count 1722
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1472 transition count 1722
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1472 transition count 1472
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1222 transition count 1472
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 924 place count 1200 transition count 1450
Iterating global reduction 2 with 22 rules applied. Total rules applied 946 place count 1200 transition count 1450
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 946 place count 1200 transition count 1436
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 974 place count 1186 transition count 1436
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 2 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 1938 place count 704 transition count 954
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1940 place count 702 transition count 952
Applied a total of 1940 rules in 163 ms. Remains 702 /1674 variables (removed 972) and now considering 952/1924 (removed 972) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 163 ms. Remains : 702/1674 places, 952/1924 transitions.
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:48:17] [INFO ] Input system was already deterministic with 952 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1674/1674 places, 1924/1924 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1673 transition count 1724
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1474 transition count 1724
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1474 transition count 1474
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1224 transition count 1474
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 918 place count 1204 transition count 1454
Iterating global reduction 2 with 20 rules applied. Total rules applied 938 place count 1204 transition count 1454
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 938 place count 1204 transition count 1441
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 964 place count 1191 transition count 1441
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 2 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 2 with 964 rules applied. Total rules applied 1928 place count 709 transition count 959
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1930 place count 707 transition count 957
Applied a total of 1930 rules in 159 ms. Remains 707 /1674 variables (removed 967) and now considering 957/1924 (removed 967) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 159 ms. Remains : 707/1674 places, 957/1924 transitions.
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:48:17] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:48:17] [INFO ] Input system was already deterministic with 957 transitions.
[2024-06-01 19:48:18] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:48:18] [INFO ] Flatten gal took : 45 ms
[2024-06-01 19:48:18] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 19:48:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1674 places, 1924 transitions and 6542 arcs took 11 ms.
Total runtime 150862 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-050B-CTLFireability-2023-15

BK_STOP 1717271298432

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1513/ctl_0_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1513/ctl_1_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1513/ctl_2_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1513/ctl_3_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1513/ctl_4_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1513/ctl_5_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1513/ctl_6_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1513/ctl_7_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1513/ctl_8_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1513/ctl_9_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1513/ctl_10_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1513/ctl_11_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1513/ctl_12_
ctl formula name ShieldRVs-PT-050B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1513/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVs-PT-050B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-050B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000858"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;