Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 927K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748542502716

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:15:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:15:04] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2025-05-29 18:15:04] [INFO ] Transformed 505 places.
[2025-05-29 18:15:04] [INFO ] Transformed 1845 transitions.
[2025-05-29 18:15:04] [INFO ] Found NUPN structural information;
[2025-05-29 18:15:04] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 252 ms.
Built sparse matrix representations for Structural reductions in 11 ms.22709KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 90 ms. Remains 505 /505 variables (removed 0) and now considering 1845/1845 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 103 ms. Remains : 505/505 places, 1845/1845 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 505 /505 variables (removed 0) and now considering 1845/1845 (removed 0) transitions.
// Phase 1: matrix 1845 rows 505 cols
[2025-05-29 18:15:04] [INFO ] Computed 21 invariants in 43 ms
[2025-05-29 18:15:04] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-05-29 18:15:04] [INFO ] Invariant cache hit.
[2025-05-29 18:15:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-29 18:15:05] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2025-05-29 18:15:05] [INFO ] Redundant transitions in 80 ms returned []
Running 1836 sub problems to find dead transitions.
[2025-05-29 18:15:05] [INFO ] Invariant cache hit.
[2025-05-29 18:15:05] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 505/505 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 10/515 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 11/526 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2025-05-29 18:15:26] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 30 ms to minimize.
[2025-05-29 18:15:26] [INFO ] Deduced a trap composed of 245 places in 316 ms of which 4 ms to minimize.
[2025-05-29 18:15:27] [INFO ] Deduced a trap composed of 161 places in 290 ms of which 4 ms to minimize.
[2025-05-29 18:15:27] [INFO ] Deduced a trap composed of 247 places in 277 ms of which 3 ms to minimize.
[2025-05-29 18:15:27] [INFO ] Deduced a trap composed of 169 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 215 places in 340 ms of which 4 ms to minimize.
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 281 places in 353 ms of which 4 ms to minimize.
[2025-05-29 18:15:28] [INFO ] Deduced a trap composed of 281 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 124 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 235 places in 277 ms of which 3 ms to minimize.
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 326 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:15:30] [INFO ] Deduced a trap composed of 282 places in 284 ms of which 3 ms to minimize.
[2025-05-29 18:15:30] [INFO ] Deduced a trap composed of 205 places in 273 ms of which 3 ms to minimize.
[2025-05-29 18:15:30] [INFO ] Deduced a trap composed of 193 places in 273 ms of which 3 ms to minimize.
[2025-05-29 18:15:31] [INFO ] Deduced a trap composed of 184 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:15:31] [INFO ] Deduced a trap composed of 140 places in 276 ms of which 3 ms to minimize.
[2025-05-29 18:15:31] [INFO ] Deduced a trap composed of 134 places in 279 ms of which 3 ms to minimize.
[2025-05-29 18:15:32] [INFO ] Deduced a trap composed of 268 places in 282 ms of which 4 ms to minimize.
[2025-05-29 18:15:32] [INFO ] Deduced a trap composed of 155 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:15:32] [INFO ] Deduced a trap composed of 310 places in 277 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/2350 variables, and 546 constraints, problems are : Problem set: 0 solved, 1836 unsolved in 30067 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/505 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1836/1836 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 505/505 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 10/515 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 11/526 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2025-05-29 18:15:50] [INFO ] Deduced a trap composed of 169 places in 277 ms of which 3 ms to minimize.
[2025-05-29 18:15:50] [INFO ] Deduced a trap composed of 183 places in 268 ms of which 3 ms to minimize.
[2025-05-29 18:15:51] [INFO ] Deduced a trap composed of 222 places in 292 ms of which 4 ms to minimize.
[2025-05-29 18:15:51] [INFO ] Deduced a trap composed of 113 places in 281 ms of which 4 ms to minimize.
[2025-05-29 18:15:51] [INFO ] Deduced a trap composed of 208 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:15:52] [INFO ] Deduced a trap composed of 142 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:15:52] [INFO ] Deduced a trap composed of 214 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:15:52] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:15:52] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:15:53] [INFO ] Deduced a trap composed of 113 places in 287 ms of which 3 ms to minimize.
[2025-05-29 18:15:53] [INFO ] Deduced a trap composed of 116 places in 280 ms of which 3 ms to minimize.
[2025-05-29 18:15:53] [INFO ] Deduced a trap composed of 132 places in 284 ms of which 4 ms to minimize.
[2025-05-29 18:15:54] [INFO ] Deduced a trap composed of 111 places in 280 ms of which 3 ms to minimize.
[2025-05-29 18:15:54] [INFO ] Deduced a trap composed of 185 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:15:54] [INFO ] Deduced a trap composed of 278 places in 296 ms of which 5 ms to minimize.
[2025-05-29 18:15:55] [INFO ] Deduced a trap composed of 84 places in 282 ms of which 4 ms to minimize.
[2025-05-29 18:15:55] [INFO ] Deduced a trap composed of 190 places in 270 ms of which 3 ms to minimize.
[2025-05-29 18:15:55] [INFO ] Deduced a trap composed of 221 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:15:56] [INFO ] Deduced a trap composed of 159 places in 276 ms of which 4 ms to minimize.
[2025-05-29 18:15:56] [INFO ] Deduced a trap composed of 197 places in 281 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/566 constraints. Problems are: Problem set: 0 solved, 1836 unsolved
[2025-05-29 18:16:08] [INFO ] Deduced a trap composed of 217 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:16:08] [INFO ] Deduced a trap composed of 203 places in 258 ms of which 3 ms to minimize.
[2025-05-29 18:16:08] [INFO ] Deduced a trap composed of 164 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:16:09] [INFO ] Deduced a trap composed of 240 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:16:09] [INFO ] Deduced a trap composed of 267 places in 265 ms of which 3 ms to minimize.
[2025-05-29 18:16:09] [INFO ] Deduced a trap composed of 271 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:16:10] [INFO ] Deduced a trap composed of 308 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:16:10] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:16:10] [INFO ] Deduced a trap composed of 186 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:16:10] [INFO ] Deduced a trap composed of 188 places in 274 ms of which 3 ms to minimize.
SMT process timed out in 65079ms, After SMT, problems are : Problem set: 0 solved, 1836 unsolved
Search for dead transitions found 0 dead transitions in 65134ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 66415 ms. Remains : 505/505 places, 1845/1845 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3160 ms (no deadlock found). (steps per millisecond=395 )
Random directed walk for 1250000 steps, including 0 resets, run took 2719 ms (no deadlock found). (steps per millisecond=459 )
[2025-05-29 18:16:16] [INFO ] Invariant cache hit.
[2025-05-29 18:16:17] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2025-05-29 18:16:17] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 474 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 42 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2025-05-29 18:16:17] [INFO ] Computed 21 invariants in 22 ms
[2025-05-29 18:16:18] [INFO ] Implicit Places using invariants in 1135 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1141 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 14 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2025-05-29 18:16:18] [INFO ] Computed 20 invariants in 20 ms
[2025-05-29 18:16:19] [INFO ] Implicit Places using invariants in 735 ms returned []
[2025-05-29 18:16:19] [INFO ] Invariant cache hit.
[2025-05-29 18:16:19] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-05-29 18:16:22] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 3840 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5038 ms. Remains : 351/505 places, 1692/1845 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 4591 ms. (8 steps per ms) remains 787/1683 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 787/787 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 787/787 properties
[2025-05-29 18:16:24] [INFO ] Invariant cache hit.
[2025-05-29 18:16:24] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)timeout

(s183 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 203/351 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 787 unsolved
SMT process timed out in 6898ms, After SMT, problems are : Problem set: 0 solved, 787 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 148 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 1692/1692 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 314 transition count 1655
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 314 transition count 1655
Applied a total of 74 rules in 54 ms. Remains 314 /351 variables (removed 37) and now considering 1655/1692 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 314/351 places, 1655/1692 transitions.
RANDOM walk for 4000000 steps (8 resets) in 94058 ms. (42 steps per ms) remains 256/787 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 251/256 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 251/251 properties
BEST_FIRST walk for 40002 steps (8 resets) in 330 ms. (120 steps per ms) remains 240/251 properties
BEST_FIRST walk for 40001 steps (8 resets) in 404 ms. (98 steps per ms) remains 239/240 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 236/239 properties
BEST_FIRST walk for 40001 steps (8 resets) in 261 ms. (152 steps per ms) remains 236/236 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 235/236 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 235/235 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 234/235 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 233/234 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 232/233 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 232/232 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 150/232 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 149/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 144/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 141/144 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 135/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 127/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 122/127 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 120/122 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 118/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 117/118 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 116/117 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 115/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 112/115 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 111/112 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 111/111 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 107/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 104/107 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 101/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 134 ms. (296 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 99/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40001 steps (8 resets) in 101 ms. (392 steps per ms) remains 94/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40001 steps (8 resets) in 121 ms. (327 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 94/94 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 86/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 85/86 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 81/85 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 81/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 78/81 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40001 steps (8 resets) in 115 ms. (344 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40001 steps (8 resets) in 119 ms. (333 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40001 steps (8 resets) in 122 ms. (325 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 78/78 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 76/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 76/76 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 74/76 properties
// Phase 1: matrix 1655 rows 314 cols
[2025-05-29 18:17:00] [INFO ] Computed 20 invariants in 12 ms
[2025-05-29 18:17:00] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 244/291 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 22/313 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:02] [INFO ] Deduced a trap composed of 127 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:17:02] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:17:02] [INFO ] Deduced a trap composed of 106 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:17:03] [INFO ] Deduced a trap composed of 109 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:03] [INFO ] Deduced a trap composed of 105 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:17:03] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:17:03] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:17:04] [INFO ] Deduced a trap composed of 118 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:17:04] [INFO ] Deduced a trap composed of 119 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:17:04] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:17:04] [INFO ] Deduced a trap composed of 109 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:17:05] [INFO ] Deduced a trap composed of 109 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:17:05] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:05] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:17:05] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:17:06] [INFO ] Deduced a trap composed of 109 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:17:06] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:06] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:17:06] [INFO ] Deduced a trap composed of 90 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:17:07] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:07] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:17:07] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:17:07] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:17:07] [INFO ] Deduced a trap composed of 92 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:17:08] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:17:08] [INFO ] Deduced a trap composed of 91 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:17:08] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:17:08] [INFO ] Deduced a trap composed of 96 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:09] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:17:09] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:17:09] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:09] [INFO ] Deduced a trap composed of 85 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 171 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 104 places in 256 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 108 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 72 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 81 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 110 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 169 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:17:15] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:15] [INFO ] Deduced a trap composed of 119 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:17:15] [INFO ] Deduced a trap composed of 195 places in 269 ms of which 3 ms to minimize.
[2025-05-29 18:17:16] [INFO ] Deduced a trap composed of 87 places in 257 ms of which 3 ms to minimize.
[2025-05-29 18:17:16] [INFO ] Deduced a trap composed of 80 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:17:16] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:17:16] [INFO ] Deduced a trap composed of 95 places in 232 ms of which 2 ms to minimize.
[2025-05-29 18:17:17] [INFO ] Deduced a trap composed of 123 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:17:17] [INFO ] Deduced a trap composed of 125 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:17:17] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:17] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 102 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 105 places in 231 ms of which 4 ms to minimize.
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 82 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 138 places in 226 ms of which 2 ms to minimize.
[2025-05-29 18:17:21] [INFO ] Deduced a trap composed of 83 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:17:21] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:17:21] [INFO ] Deduced a trap composed of 103 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:17:22] [INFO ] Deduced a trap composed of 130 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:17:22] [INFO ] Deduced a trap composed of 123 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:17:22] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:17:22] [INFO ] Deduced a trap composed of 75 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 122 places in 223 ms of which 3 ms to minimize.
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 101 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 124 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 109 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 136 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 139 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 134 places in 247 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:25] [INFO ] Deduced a trap composed of 133 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 70 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 140 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:27] [INFO ] Deduced a trap composed of 148 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:27] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:27] [INFO ] Deduced a trap composed of 95 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:27] [INFO ] Deduced a trap composed of 133 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 121 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 114 places in 220 ms of which 4 ms to minimize.
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:17:29] [INFO ] Deduced a trap composed of 124 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:29] [INFO ] Deduced a trap composed of 119 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:17:29] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:30] [INFO ] Deduced a trap composed of 88 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:17:30] [INFO ] Deduced a trap composed of 119 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:17:30] [INFO ] Deduced a trap composed of 131 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:30] [INFO ] Deduced a trap composed of 122 places in 245 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:32] [INFO ] Deduced a trap composed of 118 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:17:32] [INFO ] Deduced a trap composed of 104 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:17:32] [INFO ] Deduced a trap composed of 91 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 113 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 88 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 112 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 83 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 161 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 57 places in 276 ms of which 2 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 153 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:17:35] [INFO ] Deduced a trap composed of 97 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 118 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 134 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 115 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:17:38] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 117 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 110 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 135 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 103 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 128 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:17:45] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
SMT process timed out in 45320ms, After SMT, problems are : Problem set: 0 solved, 74 unsolved
Fused 74 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 1655/1655 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 250 transition count 1127
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 250 transition count 1127
Applied a total of 128 rules in 35 ms. Remains 250 /314 variables (removed 64) and now considering 1127/1655 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 250/314 places, 1127/1655 transitions.
RANDOM walk for 4000000 steps (8 resets) in 26956 ms. (148 steps per ms) remains 73/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 786 ms. (508 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 768 ms. (520 steps per ms) remains 71/73 properties
BEST_FIRST walk for 400004 steps (8 resets) in 760 ms. (525 steps per ms) remains 68/71 properties
BEST_FIRST walk for 400003 steps (8 resets) in 767 ms. (520 steps per ms) remains 66/68 properties
BEST_FIRST walk for 400003 steps (8 resets) in 759 ms. (526 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (8 resets) in 776 ms. (514 steps per ms) remains 65/66 properties
BEST_FIRST walk for 400004 steps (8 resets) in 747 ms. (534 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400002 steps (8 resets) in 716 ms. (557 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400002 steps (8 resets) in 721 ms. (554 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (8 resets) in 754 ms. (529 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 770 ms. (518 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (8 resets) in 781 ms. (511 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (8 resets) in 749 ms. (533 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (8 resets) in 729 ms. (547 steps per ms) remains 62/64 properties
BEST_FIRST walk for 400003 steps (8 resets) in 767 ms. (520 steps per ms) remains 59/62 properties
BEST_FIRST walk for 400003 steps (8 resets) in 740 ms. (539 steps per ms) remains 56/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 746 ms. (535 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400000 steps (8 resets) in 751 ms. (531 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400001 steps (8 resets) in 726 ms. (550 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 712 ms. (561 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400002 steps (8 resets) in 690 ms. (578 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 749 ms. (533 steps per ms) remains 51/53 properties
BEST_FIRST walk for 400001 steps (8 resets) in 713 ms. (560 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (8 resets) in 684 ms. (583 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 706 ms. (565 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (8 resets) in 708 ms. (564 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 707 ms. (564 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400003 steps (8 resets) in 747 ms. (534 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400003 steps (8 resets) in 703 ms. (568 steps per ms) remains 45/49 properties
BEST_FIRST walk for 400001 steps (8 resets) in 693 ms. (576 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400001 steps (8 resets) in 697 ms. (573 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 678 ms. (589 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 42/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 684 ms. (583 steps per ms) remains 39/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 659 ms. (606 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 673 ms. (593 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 731 ms. (546 steps per ms) remains 33/38 properties
BEST_FIRST walk for 400002 steps (8 resets) in 647 ms. (617 steps per ms) remains 30/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 631 ms. (632 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 629 ms. (634 steps per ms) remains 26/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 584 ms. (683 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 615 ms. (649 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 597 ms. (668 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 667 ms. (598 steps per ms) remains 21/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 642 ms. (622 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 655 ms. (609 steps per ms) remains 19/20 properties
// Phase 1: matrix 1127 rows 250 cols
[2025-05-29 18:18:02] [INFO ] Computed 20 invariants in 11 ms
[2025-05-29 18:18:02] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 183/203 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 45/248 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:03] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 1 ms to minimize.
[2025-05-29 18:18:03] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 1 ms to minimize.
[2025-05-29 18:18:03] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 2 ms to minimize.
[2025-05-29 18:18:03] [INFO ] Deduced a trap composed of 96 places in 179 ms of which 1 ms to minimize.
[2025-05-29 18:18:04] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:18:04] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:18:04] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:18:04] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:18:04] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 1 ms to minimize.
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 1 ms to minimize.
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 1 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 98 places in 173 ms of which 2 ms to minimize.
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:06] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 1 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:18:07] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 1 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:18:08] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/250 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:09] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:18:09] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 1 ms to minimize.
[2025-05-29 18:18:09] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:18:09] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:18:09] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 1127/1377 variables, 250/301 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1377 variables, 72/373 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1377 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1377 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1377/1377 variables, and 373 constraints, problems are : Problem set: 0 solved, 19 unsolved in 8640 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 250/250 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 183/203 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 45/248 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 31/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:12] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:18:12] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:18:12] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/250 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 18:18:12] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 2 ms to minimize.
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 2 ms to minimize.
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 1 ms to minimize.
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 1 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 1 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 1 ms to minimize.
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:18:15] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1127/1377 variables, 250/317 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1377 variables, 72/389 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1377 variables, 19/408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1377 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/1377 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1377/1377 variables, and 408 constraints, problems are : Problem set: 0 solved, 19 unsolved in 8622 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 250/250 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 47/47 constraints]
After SMT, in 17323ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2777 ms.
Support contains 20 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 1127/1127 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 225 transition count 702
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 225 transition count 702
Applied a total of 50 rules in 19 ms. Remains 225 /250 variables (removed 25) and now considering 702/1127 (removed 425) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 225/250 places, 702/1127 transitions.
RANDOM walk for 4000000 steps (8 resets) in 17677 ms. (226 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 589 ms. (677 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 566 ms. (705 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 517 ms. (772 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 533 ms. (749 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 548 ms. (728 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 519 ms. (769 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 532 ms. (750 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 532 ms. (750 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 491 ms. (813 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 486 ms. (821 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400001 steps (8 resets) in 485 ms. (823 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 494 ms. (808 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 490 ms. (814 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 494 ms. (808 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 456 ms. (875 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 479 ms. (833 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 464 ms. (860 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 450 ms. (886 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (8 resets) in 445 ms. (896 steps per ms) remains 13/13 properties
// Phase 1: matrix 702 rows 225 cols
[2025-05-29 18:18:30] [INFO ] Computed 20 invariants in 4 ms
[2025-05-29 18:18:30] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 145/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 63/222 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/225 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 18:18:31] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:18:32] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:18:32] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:18:32] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 18:18:32] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 702/927 variables, 225/255 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 72/327 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/927 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 327 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2899 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 225/225 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 145/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 63/222 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 3/225 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2025-05-29 18:18:33] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 1 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 1 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 1 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 1 ms to minimize.
[2025-05-29 18:18:34] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 702/927 variables, 225/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/927 variables, 72/336 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 13/349 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 349 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3071 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 225/225 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 19/19 constraints]
After SMT, in 6002ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 4152 ms.
Support contains 14 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 702/702 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 219 transition count 600
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 219 transition count 600
Applied a total of 12 rules in 14 ms. Remains 219 /225 variables (removed 6) and now considering 600/702 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 219/225 places, 600/702 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23115 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7419 ms. (539 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4221 ms. (947 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3939 ms. (1015 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3891 ms. (1027 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3807 ms. (1050 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3672 ms. (1089 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3370 ms. (1186 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 3320 ms. (1204 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 3203 ms. (1248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3141 ms. (1273 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 3007 ms. (1329 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 2610 ms. (1531 steps per ms) remains 1/2 properties
// Phase 1: matrix 600 rows 219 cols
[2025-05-29 18:19:04] [INFO ] Computed 20 invariants in 4 ms
[2025-05-29 18:19:04] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 183/206 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:19:04] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 600/819 variables, 219/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 72/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/819 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 183/206 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/219 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 600/819 variables, 219/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 72/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/819 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/819 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 219/219 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 600/600 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 413
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 413
Applied a total of 22 rules in 9 ms. Remains 208 /219 variables (removed 11) and now considering 413/600 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 208/219 places, 413/600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 5588 ms. (715 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3209219 steps (6 resets) in 1819 ms. (1763 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1692 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 505 transition count 1773
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 433 transition count 1773
Applied a total of 144 rules in 25 ms. Remains 433 /505 variables (removed 72) and now considering 1773/1845 (removed 72) transitions.
// Phase 1: matrix 1773 rows 433 cols
[2025-05-29 18:19:07] [INFO ] Computed 21 invariants in 11 ms
[2025-05-29 18:19:08] [INFO ] Implicit Places using invariants in 1109 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1111 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 432/505 places, 1773/1845 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 432 transition count 1692
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 351 transition count 1692
Applied a total of 162 rules in 11 ms. Remains 351 /432 variables (removed 81) and now considering 1692/1773 (removed 81) transitions.
// Phase 1: matrix 1692 rows 351 cols
[2025-05-29 18:19:08] [INFO ] Computed 20 invariants in 10 ms
[2025-05-29 18:19:08] [INFO ] Implicit Places using invariants in 660 ms returned []
[2025-05-29 18:19:08] [INFO ] Invariant cache hit.
[2025-05-29 18:19:09] [INFO ] State equation strengthened by 135 read => feed constraints.
[2025-05-29 18:19:12] [INFO ] Implicit Places using invariants and state equation in 3242 ms returned []
Implicit Place search using SMT with State Equation took 3903 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 351/505 places, 1692/1845 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5051 ms. Remains : 351/505 places, 1692/1845 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :1692 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1692 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 248290 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-09

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 505
TRANSITIONS: 1845
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 7092
NUPN UNITS: 12
LOADING TIME: 0.789

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.064
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.149
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1350
MODEL NAME: /home/mcc/execution/model
505 places, 1845 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

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="Anderson-PT-09"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Anderson-PT-09, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014-tall-174853743400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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