MCC'2025- Execution of r084-tall-174860080700507

About the Execution of 2024-gold for EisenbergMcGuire-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15688.580	1800000.00	3514325.00	2408.40	[undef]	Time out reached

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.r084-tall-174860080700507.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 EisenbergMcGuire-PT-10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 3.1M 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748743476871

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 02:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 02:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 02:04:38] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2025-06-01 02:04:38] [INFO ] Transformed 1090 places.
[2025-06-01 02:04:38] [INFO ] Transformed 5200 transitions.
[2025-06-01 02:04:38] [INFO ] Found NUPN structural information;
[2025-06-01 02:04:38] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 466 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1080 transition count 4880
Deduced a syphon composed of 310 places in 27 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 770 transition count 4880
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 14 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 680 transition count 4790
Applied a total of 820 rules in 291 ms. Remains 680 /1090 variables (removed 410) and now considering 4790/5200 (removed 410) transitions.
[2025-06-01 02:04:39] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2025-06-01 02:04:39] [INFO ] Computed 31 invariants in 32 ms
[2025-06-01 02:04:40] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2025-06-01 02:04:40] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:04:40] [INFO ] Invariant cache hit.
[2025-06-01 02:04:41] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2025-06-01 02:04:48] [INFO ] Implicit Places using invariants and state equation in 7574 ms returned []
Implicit Place search using SMT with State Equation took 8872 ms to find 0 implicit places.
Running 4780 sub problems to find dead transitions.
[2025-06-01 02:04:48] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:04:48] [INFO ] Invariant cache hit.
[2025-06-01 02:04:48] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 680/680 constraints. Problems are: Problem set: 0 solved, 4780 unsolved
SMT process timed out in 34453ms, After SMT, problems are : Problem set: 0 solved, 4780 unsolved
Search for dead transitions found 0 dead transitions in 34536ms
Starting structural reductions in LIVENESS mode, iteration 1 : 680/1090 places, 4790/5200 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 43751 ms. Remains : 680/1090 places, 4790/5200 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 16071 ms. (2 steps per ms) remains 4109/4780 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 43 ms. (2 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 4109/4109 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4109/4109 properties
[2025-06-01 02:05:27] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:05:27] [INFO ] Invariant cache hit.
[2025-06-01 02:05:27] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 4109 unsolved
SMT process timed out in 8563ms, After SMT, problems are : Problem set: 0 solved, 4109 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 532 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 299 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 600530 steps (0 resets) in 120004 ms. (5 steps per ms) remains 4083/4109 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 4082/4083 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4082 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4080/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4079/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4077/4079 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4076/4077 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 4075/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4073/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4072/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4072/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4071/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4070/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4068/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4068/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4068 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4066/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4064/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4063/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4060/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4059/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4058/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4058/4058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4058/4058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4057/4058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4056/4057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4056/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4055/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4054/4055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4054/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4054 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4052/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4052 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 4051/4051 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 4051/4051 properties
Interrupted probabilistic random walk after 755491 steps, run timeout after 105002 ms. (steps per millisecond=7 ) properties seen :729 out of 4051
Probabilistic random walk after 755491 steps, saw 562872 distinct states, run finished after 105010 ms. (steps per millisecond=7 ) properties seen :729
[2025-06-01 02:07:57] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2025-06-01 02:07:57] [INFO ] Invariant cache hit.
[2025-06-01 02:07:57] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/2600 variables, and 418 constraints, problems are : Problem set: 0 solved, 3322 unsolved in 45046 ms.
Refiners :[Domain max(s): 417/680 constraints, Positive P Invariants (semi-flows): 1/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/680 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 3322/3322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 3 (OVERLAPS) 263/680 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 263/701 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 10/711 constraints. Problems are: Problem set: 0 solved, 3322 unsolved
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 34 places in 557 ms of which 67 ms to minimize.
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 103 places in 503 ms of which 4 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 48 places in 472 ms of which 5 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 68 places in 467 ms of which 4 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 4 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 33 places in 466 ms of which 4 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 23 places in 470 ms of which 4 ms to minimize.
SMT process timed out in 93241ms, After SMT, problems are : Problem set: 0 solved, 3322 unsolved
Fused 3322 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 417 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 678 transition count 4770
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 678 transition count 4770
Applied a total of 4 rules in 228 ms. Remains 678 /680 variables (removed 2) and now considering 4770/4790 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 678/680 places, 4770/4790 transitions.
RANDOM walk for 759371 steps (0 resets) in 120004 ms. (6 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 3322/3322 properties
Interrupted probabilistic random walk after 691108 steps, run timeout after 93001 ms. (steps per millisecond=7 ) properties seen :13 out of 3322
Probabilistic random walk after 691108 steps, saw 516471 distinct states, run finished after 93002 ms. (steps per millisecond=7 ) properties seen :13
[2025-06-01 02:11:34] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
// Phase 1: matrix 1900 rows 678 cols
[2025-06-01 02:11:34] [INFO ] Computed 31 invariants in 14 ms
[2025-06-01 02:11:34] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
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/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/2578 variables, and 31 constraints, problems are : Problem set: 0 solved, 3309 unsolved in 75068 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/678 constraints, ReadFeed: 0/1228 constraints, PredecessorRefiner: 3309/3309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:13:34] [INFO ] Deduced a trap composed of 64 places in 499 ms of which 5 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 50 places in 486 ms of which 4 ms to minimize.
[2025-06-01 02:13:35] [INFO ] Deduced a trap composed of 48 places in 493 ms of which 4 ms to minimize.
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 28 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 33 places in 462 ms of which 4 ms to minimize.
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 125 places in 463 ms of which 4 ms to minimize.
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 133 places in 472 ms of which 4 ms to minimize.
[2025-06-01 02:13:38] [INFO ] Deduced a trap composed of 132 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:13:38] [INFO ] Deduced a trap composed of 128 places in 476 ms of which 4 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 64 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 4 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 25 places in 448 ms of which 4 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 128 places in 442 ms of which 4 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 121 places in 433 ms of which 4 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 132 places in 412 ms of which 4 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 31 places in 439 ms of which 4 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 21 places in 460 ms of which 4 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 149 places in 470 ms of which 4 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 128 places in 452 ms of which 4 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 124 places in 446 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:13:45] [INFO ] Deduced a trap composed of 107 places in 488 ms of which 4 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 123 places in 491 ms of which 4 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 4 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 106 places in 507 ms of which 4 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 25 places in 490 ms of which 4 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 25 places in 484 ms of which 4 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 152 places in 482 ms of which 4 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 104 places in 499 ms of which 4 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 154 places in 495 ms of which 4 ms to minimize.
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 4 ms to minimize.
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 122 places in 477 ms of which 5 ms to minimize.
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 159 places in 496 ms of which 4 ms to minimize.
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 123 places in 478 ms of which 5 ms to minimize.
[2025-06-01 02:13:52] [INFO ] Deduced a trap composed of 33 places in 493 ms of which 4 ms to minimize.
[2025-06-01 02:13:52] [INFO ] Deduced a trap composed of 166 places in 485 ms of which 4 ms to minimize.
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 141 places in 474 ms of which 4 ms to minimize.
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 107 places in 489 ms of which 4 ms to minimize.
[2025-06-01 02:13:54] [INFO ] Deduced a trap composed of 164 places in 498 ms of which 4 ms to minimize.
[2025-06-01 02:13:54] [INFO ] Deduced a trap composed of 30 places in 481 ms of which 4 ms to minimize.
[2025-06-01 02:13:55] [INFO ] Deduced a trap composed of 24 places in 499 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 148 places in 490 ms of which 4 ms to minimize.
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 128 places in 493 ms of which 4 ms to minimize.
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 118 places in 491 ms of which 4 ms to minimize.
[2025-06-01 02:13:59] [INFO ] Deduced a trap composed of 126 places in 491 ms of which 4 ms to minimize.
[2025-06-01 02:13:59] [INFO ] Deduced a trap composed of 156 places in 493 ms of which 4 ms to minimize.
[2025-06-01 02:14:00] [INFO ] Deduced a trap composed of 125 places in 486 ms of which 5 ms to minimize.
[2025-06-01 02:14:00] [INFO ] Deduced a trap composed of 22 places in 475 ms of which 4 ms to minimize.
[2025-06-01 02:14:01] [INFO ] Deduced a trap composed of 172 places in 483 ms of which 4 ms to minimize.
[2025-06-01 02:14:01] [INFO ] Deduced a trap composed of 145 places in 474 ms of which 4 ms to minimize.
[2025-06-01 02:14:02] [INFO ] Deduced a trap composed of 34 places in 511 ms of which 4 ms to minimize.
[2025-06-01 02:14:02] [INFO ] Deduced a trap composed of 146 places in 486 ms of which 5 ms to minimize.
[2025-06-01 02:14:03] [INFO ] Deduced a trap composed of 139 places in 462 ms of which 4 ms to minimize.
[2025-06-01 02:14:03] [INFO ] Deduced a trap composed of 142 places in 468 ms of which 4 ms to minimize.
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 175 places in 483 ms of which 5 ms to minimize.
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 127 places in 468 ms of which 4 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 3 places in 470 ms of which 4 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 176 places in 561 ms of which 5 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 178 places in 482 ms of which 4 ms to minimize.
[2025-06-01 02:14:06] [INFO ] Deduced a trap composed of 163 places in 483 ms of which 4 ms to minimize.
[2025-06-01 02:14:07] [INFO ] Deduced a trap composed of 137 places in 472 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/2578 variables, and 91 constraints, problems are : Problem set: 0 solved, 3309 unsolved in 75062 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/678 constraints, ReadFeed: 0/1228 constraints, PredecessorRefiner: 0/3309 constraints, Known Traps: 60/60 constraints]
After SMT, in 153026ms problems are : Problem set: 0 solved, 3309 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 414 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 350 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 678/678 places, 4770/4770 transitions.
RANDOM walk for 677406 steps (0 resets) in 120004 ms. (5 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 3309/3309 properties
Interrupted probabilistic random walk after 670923 steps, run timeout after 93001 ms. (steps per millisecond=7 ) properties seen :0 out of 3309
Probabilistic random walk after 670923 steps, saw 501648 distinct states, run finished after 93002 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-01 02:16:12] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:16:12] [INFO ] Invariant cache hit.
[2025-06-01 02:16:12] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/2578 variables, and 31 constraints, problems are : Problem set: 0 solved, 3309 unsolved in 90050 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/678 constraints, ReadFeed: 0/1228 constraints, PredecessorRefiner: 3309/3309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 64 places in 483 ms of which 4 ms to minimize.
[2025-06-01 02:18:27] [INFO ] Deduced a trap composed of 148 places in 486 ms of which 4 ms to minimize.
[2025-06-01 02:18:28] [INFO ] Deduced a trap composed of 120 places in 484 ms of which 4 ms to minimize.
[2025-06-01 02:18:28] [INFO ] Deduced a trap composed of 164 places in 477 ms of which 4 ms to minimize.
[2025-06-01 02:18:29] [INFO ] Deduced a trap composed of 176 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:18:29] [INFO ] Deduced a trap composed of 146 places in 499 ms of which 5 ms to minimize.
[2025-06-01 02:18:30] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:18:30] [INFO ] Deduced a trap composed of 15 places in 516 ms of which 4 ms to minimize.
[2025-06-01 02:18:31] [INFO ] Deduced a trap composed of 164 places in 485 ms of which 4 ms to minimize.
[2025-06-01 02:18:31] [INFO ] Deduced a trap composed of 161 places in 456 ms of which 3 ms to minimize.
[2025-06-01 02:18:32] [INFO ] Deduced a trap composed of 173 places in 448 ms of which 3 ms to minimize.
[2025-06-01 02:18:32] [INFO ] Deduced a trap composed of 32 places in 456 ms of which 3 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 34 places in 452 ms of which 3 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 50 places in 453 ms of which 4 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 48 places in 445 ms of which 4 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 3 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 174 places in 469 ms of which 5 ms to minimize.
[2025-06-01 02:18:35] [INFO ] Deduced a trap composed of 181 places in 477 ms of which 4 ms to minimize.
[2025-06-01 02:18:35] [INFO ] Deduced a trap composed of 159 places in 474 ms of which 4 ms to minimize.
[2025-06-01 02:18:36] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 54 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 164 places in 486 ms of which 5 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 119 places in 444 ms of which 4 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 131 places in 483 ms of which 5 ms to minimize.
[2025-06-01 02:18:40] [INFO ] Deduced a trap composed of 162 places in 489 ms of which 4 ms to minimize.
[2025-06-01 02:18:40] [INFO ] Deduced a trap composed of 165 places in 471 ms of which 4 ms to minimize.
[2025-06-01 02:18:41] [INFO ] Deduced a trap composed of 23 places in 474 ms of which 4 ms to minimize.
[2025-06-01 02:18:41] [INFO ] Deduced a trap composed of 160 places in 494 ms of which 5 ms to minimize.
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 150 places in 503 ms of which 4 ms to minimize.
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 113 places in 495 ms of which 4 ms to minimize.
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 3 places in 494 ms of which 4 ms to minimize.
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 4 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 4 ms to minimize.
[2025-06-01 02:18:45] [INFO ] Deduced a trap composed of 124 places in 510 ms of which 4 ms to minimize.
[2025-06-01 02:18:45] [INFO ] Deduced a trap composed of 61 places in 482 ms of which 4 ms to minimize.
[2025-06-01 02:18:46] [INFO ] Deduced a trap composed of 49 places in 488 ms of which 4 ms to minimize.
[2025-06-01 02:18:46] [INFO ] Deduced a trap composed of 73 places in 506 ms of which 4 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 4 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 4 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 111 places in 499 ms of which 4 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 151 places in 491 ms of which 4 ms to minimize.
[2025-06-01 02:18:51] [INFO ] Deduced a trap composed of 120 places in 479 ms of which 5 ms to minimize.
[2025-06-01 02:18:51] [INFO ] Deduced a trap composed of 169 places in 477 ms of which 4 ms to minimize.
[2025-06-01 02:18:52] [INFO ] Deduced a trap composed of 157 places in 455 ms of which 4 ms to minimize.
[2025-06-01 02:18:52] [INFO ] Deduced a trap composed of 131 places in 485 ms of which 4 ms to minimize.
[2025-06-01 02:18:53] [INFO ] Deduced a trap composed of 204 places in 489 ms of which 4 ms to minimize.
[2025-06-01 02:18:53] [INFO ] Deduced a trap composed of 100 places in 490 ms of which 4 ms to minimize.
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 50 places in 493 ms of which 5 ms to minimize.
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 46 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 133 places in 500 ms of which 4 ms to minimize.
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 114 places in 500 ms of which 4 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 41 places in 462 ms of which 4 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 131 places in 465 ms of which 4 ms to minimize.
[2025-06-01 02:18:57] [INFO ] Deduced a trap composed of 149 places in 497 ms of which 4 ms to minimize.
[2025-06-01 02:18:57] [INFO ] Deduced a trap composed of 146 places in 471 ms of which 4 ms to minimize.
[2025-06-01 02:18:58] [INFO ] Deduced a trap composed of 143 places in 458 ms of which 4 ms to minimize.
[2025-06-01 02:18:58] [INFO ] Deduced a trap composed of 114 places in 442 ms of which 4 ms to minimize.
[2025-06-01 02:18:59] [INFO ] Deduced a trap composed of 107 places in 451 ms of which 4 ms to minimize.
[2025-06-01 02:18:59] [INFO ] Deduced a trap composed of 37 places in 442 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:19:02] [INFO ] Deduced a trap composed of 48 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:19:03] [INFO ] Deduced a trap composed of 166 places in 472 ms of which 4 ms to minimize.
[2025-06-01 02:19:03] [INFO ] Deduced a trap composed of 173 places in 491 ms of which 4 ms to minimize.
[2025-06-01 02:19:04] [INFO ] Deduced a trap composed of 157 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:19:04] [INFO ] Deduced a trap composed of 176 places in 500 ms of which 4 ms to minimize.
[2025-06-01 02:19:05] [INFO ] Deduced a trap composed of 188 places in 501 ms of which 4 ms to minimize.
[2025-06-01 02:19:05] [INFO ] Deduced a trap composed of 159 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:19:06] [INFO ] Deduced a trap composed of 187 places in 494 ms of which 4 ms to minimize.
[2025-06-01 02:19:06] [INFO ] Deduced a trap composed of 32 places in 515 ms of which 4 ms to minimize.
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 30 places in 490 ms of which 4 ms to minimize.
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 156 places in 488 ms of which 4 ms to minimize.
[2025-06-01 02:19:08] [INFO ] Deduced a trap composed of 192 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:19:08] [INFO ] Deduced a trap composed of 150 places in 485 ms of which 5 ms to minimize.
[2025-06-01 02:19:09] [INFO ] Deduced a trap composed of 112 places in 468 ms of which 4 ms to minimize.
[2025-06-01 02:19:09] [INFO ] Deduced a trap composed of 140 places in 431 ms of which 4 ms to minimize.
[2025-06-01 02:19:10] [INFO ] Deduced a trap composed of 180 places in 436 ms of which 4 ms to minimize.
[2025-06-01 02:19:10] [INFO ] Deduced a trap composed of 162 places in 453 ms of which 4 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 42 places in 476 ms of which 4 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 168 places in 448 ms of which 3 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 45 places in 474 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 3309 unsolved
[2025-06-01 02:19:15] [INFO ] Deduced a trap composed of 159 places in 489 ms of which 4 ms to minimize.
[2025-06-01 02:19:15] [INFO ] Deduced a trap composed of 136 places in 491 ms of which 4 ms to minimize.
SMT process timed out in 183006ms, After SMT, problems are : Problem set: 0 solved, 3309 unsolved
Fused 3309 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 414 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 240 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 678/678 places, 4770/4770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 212 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
[2025-06-01 02:19:16] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:19:16] [INFO ] Invariant cache hit.
[2025-06-01 02:19:16] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-01 02:19:16] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:19:16] [INFO ] Invariant cache hit.
[2025-06-01 02:19:16] [INFO ] State equation strengthened by 1228 read => feed constraints.
[2025-06-01 02:19:18] [INFO ] Implicit Places using invariants and state equation in 2173 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
[2025-06-01 02:19:18] [INFO ] Redundant transitions in 304 ms returned []
Running 4760 sub problems to find dead transitions.
[2025-06-01 02:19:18] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:19:18] [INFO ] Invariant cache hit.
[2025-06-01 02:19:18] [INFO ] State equation strengthened by 1228 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 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 1.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 1.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 1.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 0.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 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4760 unsolved
SMT process timed out in 33949ms, After SMT, problems are : Problem set: 0 solved, 4760 unsolved
Search for dead transitions found 0 dead transitions in 33989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36917 ms. Remains : 678/678 places, 4770/4770 transitions.
RANDOM walk for 400000 steps (8 resets) in 8125 ms. (49 steps per ms) remains 202/414 properties
Running SMT prover for 202 properties.
[2025-06-01 02:19:55] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:19:55] [INFO ] Invariant cache hit.
[2025-06-01 02:19:55] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-01 02:19:55] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2025-06-01 02:19:56] [INFO ] After 684ms SMT Verify possible using state equation in real domain returned unsat :0 sat :202
[2025-06-01 02:19:56] [INFO ] State equation strengthened by 1228 read => feed constraints.
[2025-06-01 02:19:58] [INFO ] After 2104ms SMT Verify possible using 1228 Read/Feed constraints in real domain returned unsat :0 sat :202
TRAPS : Iteration 0
[2025-06-01 02:20:17] [INFO ] After 21453ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:202
[2025-06-01 02:20:17] [INFO ] After 22418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:202
[2025-06-01 02:20:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-01 02:20:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-06-01 02:20:18] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :202
[2025-06-01 02:20:20] [INFO ] After 2529ms SMT Verify possible using 1228 Read/Feed constraints in natural domain returned unsat :0 sat :202
TRAPS : Iteration 0
[2025-06-01 02:20:21] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:20:21] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1959 ms
[2025-06-01 02:20:23] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2025-06-01 02:20:23] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:20:23] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 2 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1847 ms
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:20:26] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:20:26] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:20:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2025-06-01 02:20:27] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:20:27] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2025-06-01 02:20:27] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 825 ms
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 1 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:20:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 582 ms
[2025-06-01 02:20:30] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2025-06-01 02:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-06-01 02:20:32] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-06-01 02:20:33] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2025-06-01 02:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-06-01 02:20:34] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 2 ms to minimize.
[2025-06-01 02:20:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:20:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2025-06-01 02:20:35] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:20:35] [INFO ] Deduced a trap composed of 163 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2025-06-01 02:20:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 592 ms
[2025-06-01 02:20:41] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:20:42] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2025-06-01 02:20:42] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 1 ms to minimize.
[2025-06-01 02:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2025-06-01 02:20:43] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2025-06-01 02:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 02:20:50] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 1 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 1 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 508 ms
TRAPS : Iteration 1
[2025-06-01 02:20:52] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-01 02:20:52] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-06-01 02:20:53] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2025-06-01 02:20:54] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2025-06-01 02:20:56] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2025-06-01 02:20:57] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:20:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2025-06-01 02:20:58] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2025-06-01 02:20:59] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:20:59] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:20:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2025-06-01 02:21:01] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:21:01] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2025-06-01 02:21:03] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2025-06-01 02:21:04] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
TRAPS : Iteration 2
[2025-06-01 02:21:15] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2025-06-01 02:21:25] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
TRAPS : Iteration 3
[2025-06-01 02:21:46] [INFO ] Deduced a trap composed of 87 places in 392 ms of which 4 ms to minimize.
[2025-06-01 02:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
TRAPS : Iteration 4
[2025-06-01 02:22:18] [INFO ] After 119966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :202
[2025-06-01 02:22:21] [INFO ] After 124250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :202
RANDOM walk for 395088 steps (0 resets) in 120004 ms. (3 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3309/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 3308/3309 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3308/3308 properties
Interrupted probabilistic random walk after 681439 steps, run timeout after 93001 ms. (steps per millisecond=7 ) properties seen :0 out of 3308
Probabilistic random walk after 681439 steps, saw 509402 distinct states, run finished after 93002 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-01 02:24:26] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:24:26] [INFO ] Invariant cache hit.
[2025-06-01 02:24:26] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
[2025-06-01 02:26:06] [INFO ] Deduced a trap composed of 64 places in 497 ms of which 4 ms to minimize.
[2025-06-01 02:26:07] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 5 ms to minimize.
[2025-06-01 02:26:07] [INFO ] Deduced a trap composed of 200 places in 472 ms of which 4 ms to minimize.
[2025-06-01 02:26:08] [INFO ] Deduced a trap composed of 105 places in 482 ms of which 4 ms to minimize.
[2025-06-01 02:26:08] [INFO ] Deduced a trap composed of 117 places in 456 ms of which 4 ms to minimize.
[2025-06-01 02:26:09] [INFO ] Deduced a trap composed of 94 places in 428 ms of which 4 ms to minimize.
[2025-06-01 02:26:09] [INFO ] Deduced a trap composed of 108 places in 466 ms of which 4 ms to minimize.
[2025-06-01 02:26:10] [INFO ] Deduced a trap composed of 109 places in 462 ms of which 4 ms to minimize.
[2025-06-01 02:26:10] [INFO ] Deduced a trap composed of 156 places in 452 ms of which 4 ms to minimize.
[2025-06-01 02:26:11] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 4 ms to minimize.
[2025-06-01 02:26:11] [INFO ] Deduced a trap composed of 25 places in 484 ms of which 5 ms to minimize.
[2025-06-01 02:26:12] [INFO ] Deduced a trap composed of 164 places in 467 ms of which 4 ms to minimize.
[2025-06-01 02:26:12] [INFO ] Deduced a trap composed of 25 places in 492 ms of which 4 ms to minimize.
[2025-06-01 02:26:13] [INFO ] Deduced a trap composed of 68 places in 470 ms of which 4 ms to minimize.
[2025-06-01 02:26:13] [INFO ] Deduced a trap composed of 185 places in 479 ms of which 4 ms to minimize.
[2025-06-01 02:26:14] [INFO ] Deduced a trap composed of 148 places in 473 ms of which 4 ms to minimize.
[2025-06-01 02:26:14] [INFO ] Deduced a trap composed of 137 places in 431 ms of which 4 ms to minimize.
SMT process timed out in 108302ms, After SMT, problems are : Problem set: 0 solved, 3308 unsolved
Fused 3308 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 414 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 198 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 678/678 places, 4770/4770 transitions.
RANDOM walk for 386901 steps (0 resets) in 120004 ms. (3 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 3308/3308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 3308/3308 properties
Interrupted probabilistic random walk after 676720 steps, run timeout after 93001 ms. (steps per millisecond=7 ) properties seen :0 out of 3308
Probabilistic random walk after 676720 steps, saw 505962 distinct states, run finished after 93001 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-01 02:28:19] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:28:19] [INFO ] Invariant cache hit.
[2025-06-01 02:28:19] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 2 (OVERLAPS) 264/678 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/678 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
[2025-06-01 02:29:58] [INFO ] Deduced a trap composed of 64 places in 467 ms of which 4 ms to minimize.
[2025-06-01 02:29:58] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 4 ms to minimize.
[2025-06-01 02:29:59] [INFO ] Deduced a trap composed of 200 places in 453 ms of which 4 ms to minimize.
[2025-06-01 02:29:59] [INFO ] Deduced a trap composed of 105 places in 460 ms of which 4 ms to minimize.
[2025-06-01 02:30:00] [INFO ] Deduced a trap composed of 117 places in 446 ms of which 4 ms to minimize.
[2025-06-01 02:30:00] [INFO ] Deduced a trap composed of 94 places in 451 ms of which 4 ms to minimize.
[2025-06-01 02:30:01] [INFO ] Deduced a trap composed of 108 places in 419 ms of which 4 ms to minimize.
[2025-06-01 02:30:01] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 3 ms to minimize.
[2025-06-01 02:30:02] [INFO ] Deduced a trap composed of 156 places in 446 ms of which 4 ms to minimize.
[2025-06-01 02:30:02] [INFO ] Deduced a trap composed of 28 places in 432 ms of which 4 ms to minimize.
[2025-06-01 02:30:03] [INFO ] Deduced a trap composed of 25 places in 463 ms of which 4 ms to minimize.
[2025-06-01 02:30:03] [INFO ] Deduced a trap composed of 164 places in 465 ms of which 4 ms to minimize.
[2025-06-01 02:30:04] [INFO ] Deduced a trap composed of 25 places in 469 ms of which 4 ms to minimize.
[2025-06-01 02:30:04] [INFO ] Deduced a trap composed of 68 places in 451 ms of which 3 ms to minimize.
[2025-06-01 02:30:04] [INFO ] Deduced a trap composed of 185 places in 457 ms of which 4 ms to minimize.
[2025-06-01 02:30:05] [INFO ] Deduced a trap composed of 148 places in 452 ms of which 4 ms to minimize.
[2025-06-01 02:30:05] [INFO ] Deduced a trap composed of 137 places in 427 ms of which 4 ms to minimize.
[2025-06-01 02:30:06] [INFO ] Deduced a trap composed of 137 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:30:06] [INFO ] Deduced a trap composed of 190 places in 419 ms of which 6 ms to minimize.
[2025-06-01 02:30:07] [INFO ] Deduced a trap composed of 115 places in 483 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/678 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
[2025-06-01 02:30:09] [INFO ] Deduced a trap composed of 63 places in 442 ms of which 4 ms to minimize.
[2025-06-01 02:30:09] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 4 ms to minimize.
[2025-06-01 02:30:10] [INFO ] Deduced a trap composed of 164 places in 446 ms of which 4 ms to minimize.
[2025-06-01 02:30:10] [INFO ] Deduced a trap composed of 95 places in 441 ms of which 4 ms to minimize.
[2025-06-01 02:30:11] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 3 ms to minimize.
[2025-06-01 02:30:11] [INFO ] Deduced a trap composed of 66 places in 444 ms of which 4 ms to minimize.
[2025-06-01 02:30:11] [INFO ] Deduced a trap composed of 92 places in 437 ms of which 4 ms to minimize.
[2025-06-01 02:30:12] [INFO ] Deduced a trap composed of 37 places in 460 ms of which 4 ms to minimize.
[2025-06-01 02:30:12] [INFO ] Deduced a trap composed of 66 places in 466 ms of which 4 ms to minimize.
[2025-06-01 02:30:13] [INFO ] Deduced a trap composed of 125 places in 451 ms of which 4 ms to minimize.
[2025-06-01 02:30:13] [INFO ] Deduced a trap composed of 129 places in 463 ms of which 4 ms to minimize.
[2025-06-01 02:30:14] [INFO ] Deduced a trap composed of 31 places in 479 ms of which 3 ms to minimize.
[2025-06-01 02:30:14] [INFO ] Deduced a trap composed of 133 places in 467 ms of which 3 ms to minimize.
[2025-06-01 02:30:15] [INFO ] Deduced a trap composed of 140 places in 472 ms of which 4 ms to minimize.
[2025-06-01 02:30:15] [INFO ] Deduced a trap composed of 65 places in 461 ms of which 4 ms to minimize.
[2025-06-01 02:30:16] [INFO ] Deduced a trap composed of 39 places in 452 ms of which 3 ms to minimize.
[2025-06-01 02:30:16] [INFO ] Deduced a trap composed of 158 places in 453 ms of which 3 ms to minimize.
[2025-06-01 02:30:17] [INFO ] Deduced a trap composed of 132 places in 453 ms of which 4 ms to minimize.
[2025-06-01 02:30:17] [INFO ] Deduced a trap composed of 142 places in 435 ms of which 4 ms to minimize.
[2025-06-01 02:30:18] [INFO ] Deduced a trap composed of 43 places in 473 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 3308 unsolved
[2025-06-01 02:30:20] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 4 ms to minimize.
[2025-06-01 02:30:20] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 4 ms to minimize.
[2025-06-01 02:30:21] [INFO ] Deduced a trap composed of 33 places in 457 ms of which 3 ms to minimize.
[2025-06-01 02:30:21] [INFO ] Deduced a trap composed of 282 places in 464 ms of which 4 ms to minimize.
[2025-06-01 02:30:22] [INFO ] Deduced a trap composed of 63 places in 454 ms of which 5 ms to minimize.
[2025-06-01 02:30:22] [INFO ] Deduced a trap composed of 24 places in 458 ms of which 4 ms to minimize.
SMT process timed out in 123412ms, After SMT, problems are : Problem set: 0 solved, 3308 unsolved
Fused 3308 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 414 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 193 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 678/678 places, 4770/4770 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Applied a total of 0 rules in 186 ms. Remains 678 /678 variables (removed 0) and now considering 4770/4770 (removed 0) transitions.
[2025-06-01 02:30:23] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:30:23] [INFO ] Invariant cache hit.
[2025-06-01 02:30:23] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-01 02:30:23] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:30:23] [INFO ] Invariant cache hit.
[2025-06-01 02:30:23] [INFO ] State equation strengthened by 1228 read => feed constraints.
[2025-06-01 02:30:25] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2025-06-01 02:30:25] [INFO ] Redundant transitions in 335 ms returned []
Running 4760 sub problems to find dead transitions.
[2025-06-01 02:30:25] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:30:25] [INFO ] Invariant cache hit.
[2025-06-01 02:30:25] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/678 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4760 unsolved
SMT process timed out in 33713ms, After SMT, problems are : Problem set: 0 solved, 4760 unsolved
Search for dead transitions found 0 dead transitions in 33752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36563 ms. Remains : 678/678 places, 4770/4770 transitions.
RANDOM walk for 400000 steps (8 resets) in 14126 ms. (28 steps per ms) remains 202/414 properties
Running SMT prover for 202 properties.
[2025-06-01 02:31:03] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:31:03] [INFO ] Invariant cache hit.
[2025-06-01 02:31:03] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2025-06-01 02:31:03] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2025-06-01 02:31:04] [INFO ] After 651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :202
[2025-06-01 02:31:04] [INFO ] State equation strengthened by 1228 read => feed constraints.
[2025-06-01 02:31:06] [INFO ] After 1834ms SMT Verify possible using 1228 Read/Feed constraints in real domain returned unsat :0 sat :202
TRAPS : Iteration 0
[2025-06-01 02:31:24] [INFO ] After 20307ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:202
[2025-06-01 02:31:24] [INFO ] After 21204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:202
[2025-06-01 02:31:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2025-06-01 02:31:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2025-06-01 02:31:25] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :202
[2025-06-01 02:31:27] [INFO ] After 2275ms SMT Verify possible using 1228 Read/Feed constraints in natural domain returned unsat :0 sat :202
TRAPS : Iteration 0
[2025-06-01 02:31:27] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:31:28] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 2 ms to minimize.
[2025-06-01 02:31:28] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
[2025-06-01 02:31:28] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2025-06-01 02:31:28] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
[2025-06-01 02:31:29] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:31:29] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2025-06-01 02:31:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1670 ms
[2025-06-01 02:31:29] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2025-06-01 02:31:29] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:31:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2025-06-01 02:31:30] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-01 02:31:30] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2025-06-01 02:31:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-01 02:31:30] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:31:30] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:31:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2025-06-01 02:31:32] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2025-06-01 02:31:33] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:31:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-01 02:31:33] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:31:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:31:34] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:31:34] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:31:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2025-06-01 02:31:35] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:31:37] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:31:38] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2025-06-01 02:31:39] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:31:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-06-01 02:31:40] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-01 02:31:40] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:31:41] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 1 ms to minimize.
[2025-06-01 02:31:41] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:31:41] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:31:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 881 ms
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:31:43] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:31:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 723 ms
[2025-06-01 02:31:45] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:31:45] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2025-06-01 02:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2025-06-01 02:31:46] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:31:46] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:31:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2025-06-01 02:31:47] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-01 02:31:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-01 02:31:49] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:31:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 02:31:51] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:31:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:31:53] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2025-06-01 02:31:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:31:55] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:31:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
TRAPS : Iteration 1
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:31:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2025-06-01 02:31:56] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:31:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-01 02:31:57] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2025-06-01 02:31:58] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2025-06-01 02:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2025-06-01 02:31:59] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2025-06-01 02:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-06-01 02:32:02] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2025-06-01 02:32:04] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2025-06-01 02:32:07] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2025-06-01 02:32:15] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:32:16] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2025-06-01 02:32:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
TRAPS : Iteration 2
[2025-06-01 02:32:17] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-06-01 02:32:18] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2025-06-01 02:32:19] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2025-06-01 02:32:19] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2025-06-01 02:32:20] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:32:22] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-01 02:32:26] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:32:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2025-06-01 02:32:30] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-01 02:32:32] [INFO ] Deduced a trap composed of 162 places in 409 ms of which 3 ms to minimize.
[2025-06-01 02:32:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2025-06-01 02:32:39] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:32:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
TRAPS : Iteration 3
[2025-06-01 02:32:59] [INFO ] After 94573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :202
[2025-06-01 02:33:02] [INFO ] After 98242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :202
RANDOM walk for 625 steps (0 resets) in 13 ms. (44 steps per ms) remains 0/1 properties
RANDOM walk for 781 steps (0 resets) in 17 ms. (43 steps per ms) remains 0/1 properties
RANDOM walk for 2787 steps (0 resets) in 27 ms. (99 steps per ms) remains 0/1 properties
RANDOM walk for 3562 steps (0 resets) in 25 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 4067 steps (0 resets) in 31 ms. (127 steps per ms) remains 0/1 properties
RANDOM walk for 4517 steps (0 resets) in 31 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 5628 steps (0 resets) in 36 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 5731 steps (0 resets) in 38 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 1758 steps (0 resets) in 15 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 730 steps (0 resets) in 11 ms. (60 steps per ms) remains 0/1 properties
RANDOM walk for 2277 steps (0 resets) in 28 ms. (78 steps per ms) remains 0/1 properties
RANDOM walk for 1723 steps (0 resets) in 19 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 2773 steps (0 resets) in 23 ms. (115 steps per ms) remains 0/1 properties
RANDOM walk for 2365 steps (0 resets) in 25 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 3719 steps (0 resets) in 32 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 4297 steps (0 resets) in 34 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 4842 steps (0 resets) in 52 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 5724 steps (0 resets) in 39 ms. (143 steps per ms) remains 0/1 properties
RANDOM walk for 6481 steps (0 resets) in 44 ms. (144 steps per ms) remains 0/1 properties
RANDOM walk for 304 steps (0 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 1446 steps (0 resets) in 13 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 2285 steps (0 resets) in 21 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 2972 steps (0 resets) in 25 ms. (114 steps per ms) remains 0/1 properties
RANDOM walk for 3795 steps (0 resets) in 28 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 4626 steps (0 resets) in 34 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 5109 steps (0 resets) in 34 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 5577 steps (0 resets) in 35 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 6157 steps (0 resets) in 36 ms. (166 steps per ms) remains 0/1 properties
RANDOM walk for 269 steps (0 resets) in 5 ms. (44 steps per ms) remains 0/1 properties
RANDOM walk for 959 steps (0 resets) in 10 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 2109 steps (0 resets) in 17 ms. (117 steps per ms) remains 0/1 properties
RANDOM walk for 2940 steps (0 resets) in 22 ms. (127 steps per ms) remains 0/1 properties
RANDOM walk for 3620 steps (0 resets) in 25 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 4626 steps (0 resets) in 28 ms. (159 steps per ms) remains 0/1 properties
RANDOM walk for 5401 steps (0 resets) in 34 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 5631 steps (0 resets) in 32 ms. (170 steps per ms) remains 0/1 properties
RANDOM walk for 6299 steps (0 resets) in 38 ms. (161 steps per ms) remains 0/1 properties
RANDOM walk for 104 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 419 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 1477 steps (0 resets) in 14 ms. (98 steps per ms) remains 0/1 properties
RANDOM walk for 2743 steps (0 resets) in 19 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 3811 steps (0 resets) in 26 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 4098 steps (0 resets) in 29 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 5246 steps (0 resets) in 36 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 5731 steps (0 resets) in 32 ms. (173 steps per ms) remains 0/1 properties
RANDOM walk for 6737 steps (0 resets) in 39 ms. (168 steps per ms) remains 0/1 properties
RANDOM walk for 89 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 869 steps (0 resets) in 10 ms. (79 steps per ms) remains 0/1 properties
RANDOM walk for 1540 steps (0 resets) in 18 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 2050 steps (0 resets) in 21 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 3800 steps (0 resets) in 23 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 3951 steps (0 resets) in 30 ms. (127 steps per ms) remains 0/1 properties
RANDOM walk for 5003 steps (0 resets) in 32 ms. (151 steps per ms) remains 0/1 properties
RANDOM walk for 5740 steps (0 resets) in 38 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 6188 steps (0 resets) in 44 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 180 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 920 steps (0 resets) in 11 ms. (76 steps per ms) remains 0/1 properties
RANDOM walk for 1552 steps (0 resets) in 17 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 2317 steps (0 resets) in 26 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 3176 steps (0 resets) in 23 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 4842 steps (0 resets) in 33 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 5662 steps (0 resets) in 32 ms. (171 steps per ms) remains 0/1 properties
RANDOM walk for 6270 steps (0 resets) in 41 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 112 steps (0 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 884 steps (0 resets) in 9 ms. (88 steps per ms) remains 0/1 properties
RANDOM walk for 1503 steps (0 resets) in 17 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 2555 steps (0 resets) in 27 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 2636 steps (0 resets) in 20 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 3903 steps (0 resets) in 28 ms. (134 steps per ms) remains 0/1 properties
RANDOM walk for 5045 steps (0 resets) in 43 ms. (114 steps per ms) remains 0/1 properties
RANDOM walk for 6115 steps (0 resets) in 36 ms. (165 steps per ms) remains 0/1 properties
RANDOM walk for 6888 steps (0 resets) in 44 ms. (153 steps per ms) remains 0/1 properties
RANDOM walk for 180 steps (0 resets) in 4 ms. (36 steps per ms) remains 0/1 properties
RANDOM walk for 674 steps (0 resets) in 7 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 1661 steps (0 resets) in 18 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 2314 steps (0 resets) in 19 ms. (115 steps per ms) remains 0/1 properties
RANDOM walk for 3320 steps (0 resets) in 33 ms. (97 steps per ms) remains 0/1 properties
RANDOM walk for 3945 steps (0 resets) in 38 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 4205 steps (0 resets) in 31 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 5688 steps (0 resets) in 41 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 6660 steps (0 resets) in 41 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 152 steps (0 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 949 steps (0 resets) in 8 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 1613 steps (0 resets) in 14 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 2326 steps (0 resets) in 26 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 3364 steps (0 resets) in 27 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 3552 steps (0 resets) in 28 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 3862 steps (0 resets) in 27 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 4815 steps (0 resets) in 36 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 142 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 512 steps (0 resets) in 7 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 1352 steps (0 resets) in 14 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 2164 steps (0 resets) in 25 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 2645 steps (0 resets) in 24 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 3845 steps (0 resets) in 29 ms. (128 steps per ms) remains 0/1 properties
RANDOM walk for 4065 steps (0 resets) in 28 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 5201 steps (0 resets) in 36 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 5845 steps (0 resets) in 38 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 75 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 21796 steps (5 resets) in 41 ms. (518 steps per ms) remains 0/1 properties
RANDOM walk for 782 steps (0 resets) in 9 ms. (78 steps per ms) remains 0/1 properties
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 1541 steps (0 resets) in 13 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 2450 steps (0 resets) in 28 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 2667 steps (0 resets) in 35 ms. (74 steps per ms) remains 0/1 properties
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 3646 steps (0 resets) in 34 ms. (104 steps per ms) remains 0/1 properties
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 35 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 4312 steps (0 resets) in 45 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 5119 steps (0 resets) in 49 ms. (102 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 5469 steps (0 resets) in 46 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 47 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 6450 steps (0 resets) in 64 ms. (99 steps per ms) remains 0/1 properties
RANDOM walk for 57 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 394284 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 394284 steps, saw 300502 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2025-06-01 02:33:08] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:33:08] [INFO ] Invariant cache hit.
[2025-06-01 02:33:08] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:08] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1420/2578 variables, 493/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/2578 variables, 1099/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2578/2578 variables, and 1938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:09] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:33:10] [INFO ] Deduced a trap composed of 21 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:33:10] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 4 ms to minimize.
[2025-06-01 02:33:10] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 2 ms to minimize.
[2025-06-01 02:33:10] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:33:11] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 2 ms to minimize.
[2025-06-01 02:33:11] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 1 ms to minimize.
[2025-06-01 02:33:11] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:33:11] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 9/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1420/2578 variables, 493/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2578 variables, 1099/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2578 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2578 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2578/2578 variables, and 1948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3129 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3989ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6925 steps, including 306 resets, run visited all 1 properties in 94 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 101 ms.
RANDOM walk for 108 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 398486 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 398486 steps, saw 303519 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2025-06-01 02:33:15] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:33:15] [INFO ] Invariant cache hit.
[2025-06-01 02:33:15] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/259 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:15] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1420/2578 variables, 493/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/2578 variables, 1099/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2578/2578 variables, and 1938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:16] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2025-06-01 02:33:17] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 2 ms to minimize.
[2025-06-01 02:33:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1420/2578 variables, 493/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2578 variables, 1099/1942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2578 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2578 variables, 0/1942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2578/2578 variables, and 1942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1403 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4505 steps, including 195 resets, run visited all 1 properties in 31 ms. (steps per millisecond=145 )
Parikh walk visited 1 properties in 31 ms.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393459 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393459 steps, saw 299875 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2025-06-01 02:33:20] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:33:20] [INFO ] Invariant cache hit.
[2025-06-01 02:33:20] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/259 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/431 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 91/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/665 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/665 variables, 36/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 475/1140 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1140 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/1158 variables, 9/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:21] [INFO ] Deduced a trap composed of 117 places in 471 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1158 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1420/2578 variables, 493/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/2578 variables, 1099/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2578/2578 variables, and 1938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:22] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:22] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 3 ms to minimize.
[2025-06-01 02:33:22] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:33:23] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:33:23] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:33:23] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2025-06-01 02:33:23] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:33:23] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1158 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1420/2578 variables, 493/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2578 variables, 1099/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2578/2578 variables, and 1947 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 590 transition count 3890
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 590 transition count 3890
Applied a total of 176 rules in 181 ms. Remains 590 /678 variables (removed 88) and now considering 3890/4770 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 590/678 places, 3890/4770 transitions.
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 438207 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 438207 steps, saw 286884 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2025-06-01 02:33:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2025-06-01 02:33:27] [INFO ] Computed 31 invariants in 12 ms
[2025-06-01 02:33:27] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 388/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:33:28] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 3 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 2 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:33:29] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 2 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:33:30] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:33:31] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:33:31] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 15/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 388/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1074 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 117 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 118 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2025-06-01 02:33:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:33:31] [INFO ] Invariant cache hit.
[2025-06-01 02:33:32] [INFO ] Implicit Places using invariants in 666 ms returned []
[2025-06-01 02:33:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:33:32] [INFO ] Invariant cache hit.
[2025-06-01 02:33:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-01 02:33:35] [INFO ] Implicit Places using invariants and state equation in 3416 ms returned []
Implicit Place search using SMT with State Equation took 4083 ms to find 0 implicit places.
[2025-06-01 02:33:36] [INFO ] Redundant transitions in 128 ms returned []
Running 3880 sub problems to find dead transitions.
[2025-06-01 02:33:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:33:36] [INFO ] Invariant cache hit.
[2025-06-01 02:33:36] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32652ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37028 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 63 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2025-06-01 02:34:08] [INFO ] Computed 21 invariants in 1 ms
[2025-06-01 02:34:08] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2025-06-01 02:34:08] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:34:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 02:34:08] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:34:08] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:34:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2025-06-01 02:34:09] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:34:09] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:34:09] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:34:09] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 240 ms.
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384802 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384802 steps, saw 293372 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2025-06-01 02:34:12] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
// Phase 1: matrix 1900 rows 678 cols
[2025-06-01 02:34:12] [INFO ] Computed 31 invariants in 14 ms
[2025-06-01 02:34:12] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1420/2578 variables, 493/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/2578 variables, 1099/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2578/2578 variables, and 1938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:13] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2025-06-01 02:34:13] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:34:14] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 2 ms to minimize.
[2025-06-01 02:34:14] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 2 ms to minimize.
[2025-06-01 02:34:14] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 2 ms to minimize.
[2025-06-01 02:34:14] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:34:14] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:34:15] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1420/2578 variables, 493/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2578 variables, 1099/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2578/2578 variables, and 1947 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2630 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3474ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3533 steps, including 183 resets, run visited all 1 properties in 24 ms. (steps per millisecond=147 )
Parikh walk visited 1 properties in 25 ms.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384780 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 384780 steps, saw 293359 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2025-06-01 02:34:18] [INFO ] Flow matrix only has 1900 transitions (discarded 2870 similar events)
[2025-06-01 02:34:18] [INFO ] Invariant cache hit.
[2025-06-01 02:34:18] [INFO ] State equation strengthened by 1228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:18] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1420/2578 variables, 493/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/2578 variables, 1099/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2578 variables, 0/1938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2578/2578 variables, and 1938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/259 variables, 67/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/431 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 91/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/665 variables, 108/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/665 variables, 36/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/665 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 475/1140 variables, 18/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1140 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/1158 variables, 9/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1158 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:20] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 2 ms to minimize.
[2025-06-01 02:34:20] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:34:20] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:34:20] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:34:21] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 2 ms to minimize.
[2025-06-01 02:34:21] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2025-06-01 02:34:21] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2025-06-01 02:34:21] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1158 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1158 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1420/2578 variables, 493/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2578 variables, 1099/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2578 variables, 0/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2578/2578 variables, and 1947 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 678/678 constraints, ReadFeed: 1228/1228 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3457ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 4770/4770 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 590 transition count 3890
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 590 transition count 3890
Applied a total of 176 rules in 157 ms. Remains 590 /678 variables (removed 88) and now considering 3890/4770 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 590/678 places, 3890/4770 transitions.
RANDOM walk for 40000 steps (8 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 434302 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 434302 steps, saw 284524 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2025-06-01 02:34:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2025-06-01 02:34:25] [INFO ] Computed 31 invariants in 7 ms
[2025-06-01 02:34:25] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 630/1610 variables, 414/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 388/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1610 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 36/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:34:26] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 2 ms to minimize.
[2025-06-01 02:34:26] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:34:26] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:34:27] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2025-06-01 02:34:28] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2025-06-01 02:34:28] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2025-06-01 02:34:28] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:34:28] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 388/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1073 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2914 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 3489ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 136 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2025-06-01 02:34:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:34:29] [INFO ] Invariant cache hit.
[2025-06-01 02:34:30] [INFO ] Implicit Places using invariants in 657 ms returned []
[2025-06-01 02:34:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:34:30] [INFO ] Invariant cache hit.
[2025-06-01 02:34:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2025-06-01 02:34:33] [INFO ] Implicit Places using invariants and state equation in 3781 ms returned []
Implicit Place search using SMT with State Equation took 4440 ms to find 0 implicit places.
[2025-06-01 02:34:33] [INFO ] Redundant transitions in 126 ms returned []
Running 3880 sub problems to find dead transitions.
[2025-06-01 02:34:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2025-06-01 02:34:33] [INFO ] Invariant cache hit.
[2025-06-01 02:34:33] [INFO ] State equation strengthened by 436 read => feed constraints.

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 QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="QuasiLiveness"
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 EisenbergMcGuire-PT-10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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