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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 2.3M 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 1748743151816

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:59:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:59:13] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2025-06-01 01:59:13] [INFO ] Transformed 891 places.
[2025-06-01 01:59:13] [INFO ] Transformed 3888 transitions.
[2025-06-01 01:59:13] [INFO ] Found NUPN structural information;
[2025-06-01 01:59:13] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 390 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 882 transition count 3627
Deduced a syphon composed of 252 places in 20 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 630 transition count 3627
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 7 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 558 transition count 3555
Applied a total of 666 rules in 219 ms. Remains 558 /891 variables (removed 333) and now considering 3555/3888 (removed 333) transitions.
[2025-06-01 01:59:13] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
// Phase 1: matrix 1476 rows 558 cols
[2025-06-01 01:59:14] [INFO ] Computed 28 invariants in 32 ms
[2025-06-01 01:59:14] [INFO ] Implicit Places using invariants in 978 ms returned []
[2025-06-01 01:59:14] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 01:59:14] [INFO ] Invariant cache hit.
[2025-06-01 01:59:15] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-06-01 01:59:20] [INFO ] Implicit Places using invariants and state equation in 5112 ms returned []
Implicit Place search using SMT with State Equation took 6129 ms to find 0 implicit places.
Running 3546 sub problems to find dead transitions.
[2025-06-01 01:59:20] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 01:59:20] [INFO ] Invariant cache hit.
[2025-06-01 01:59:20] [INFO ] State equation strengthened by 932 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/558 variables, 558/558 constraints. Problems are: Problem set: 0 solved, 3546 unsolved
SMT process timed out in 32887ms, After SMT, problems are : Problem set: 0 solved, 3546 unsolved
Search for dead transitions found 0 dead transitions in 32946ms
Starting structural reductions in LIVENESS mode, iteration 1 : 558/891 places, 3555/3888 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 39338 ms. Remains : 558/891 places, 3555/3888 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 11341 ms. (3 steps per ms) remains 2995/3546 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 54 ms. (2 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 64 ms. (1 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2995/2995 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2995/2995 properties
[2025-06-01 01:59:56] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 01:59:56] [INFO ] Invariant cache hit.
[2025-06-01 01:59:56] [INFO ] State equation strengthened by 932 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/434 variables, 434/434 constraints. Problems are: Problem set: 0 solved, 2995 unsolved
SMT process timed out in 7374ms, After SMT, problems are : Problem set: 0 solved, 2995 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 434 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 3555/3555 transitions.
Applied a total of 0 rules in 247 ms. Remains 558 /558 variables (removed 0) and now considering 3555/3555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 558/558 places, 3555/3555 transitions.
RANDOM walk for 826976 steps (0 resets) in 120004 ms. (6 steps per ms) remains 2977/2995 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2975/2977 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2974/2975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2974/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2972/2974 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2970/2972 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2970/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2968/2970 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2968/2968 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2967/2968 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2965/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2965/2965 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2965/2965 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2965/2965 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2965 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2960/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2960/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2959/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2957/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 218 ms. (18 steps per ms) remains 2956/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2955/2956 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2955/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2954/2955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2953/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2953/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2953/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2952/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2952/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2950/2952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2950/2950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2950 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2945/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2945/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2944/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2944/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2943/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2943/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2943 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 248 ms. (16 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2942/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2942 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
Interrupted probabilistic random walk after 914050 steps, run timeout after 105002 ms. (steps per millisecond=8 ) properties seen :645 out of 2941
Probabilistic random walk after 914050 steps, saw 643855 distinct states, run finished after 105009 ms. (steps per millisecond=8 ) properties seen :645
[2025-06-01 02:02:24] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 02:02:24] [INFO ] Invariant cache hit.
[2025-06-01 02:02:24] [INFO ] State equation strengthened by 932 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 2296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 2296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2296 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 242/558 variables, 18/335 constraints. Problems are: Problem set: 0 solved, 2296 unsolved
SMT process timed out in 46758ms, After SMT, problems are : Problem set: 0 solved, 2296 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 316 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 3555/3555 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 551 transition count 3492
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 551 transition count 3492
Applied a total of 14 rules in 152 ms. Remains 551 /558 variables (removed 7) and now considering 3492/3555 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 551/558 places, 3492/3555 transitions.
RANDOM walk for 1167579 steps (0 resets) in 120004 ms. (9 steps per ms) remains 2293/2296 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2293/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2293/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2293/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2293/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2293/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2292/2293 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2292/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2291/2292 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 187 ms. (21 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2291/2291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2291/2291 properties
Interrupted probabilistic random walk after 823770 steps, run timeout after 93001 ms. (steps per millisecond=8 ) properties seen :26 out of 2291
Probabilistic random walk after 823770 steps, saw 575645 distinct states, run finished after 93001 ms. (steps per millisecond=8 ) properties seen :26
[2025-06-01 02:05:15] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
// Phase 1: matrix 1413 rows 551 cols
[2025-06-01 02:05:15] [INFO ] Computed 28 invariants in 12 ms
[2025-06-01 02:05:15] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 38 places in 449 ms of which 59 ms to minimize.
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 4 ms to minimize.
[2025-06-01 02:06:08] [INFO ] Deduced a trap composed of 35 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:06:09] [INFO ] Deduced a trap composed of 24 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:06:09] [INFO ] Deduced a trap composed of 57 places in 396 ms of which 4 ms to minimize.
[2025-06-01 02:06:10] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:06:10] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 4 ms to minimize.
[2025-06-01 02:06:10] [INFO ] Deduced a trap composed of 27 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:06:11] [INFO ] Deduced a trap composed of 45 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:06:11] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 4 ms to minimize.
[2025-06-01 02:06:12] [INFO ] Deduced a trap composed of 47 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:06:12] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 68 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 95 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 1 ms to minimize.
[2025-06-01 02:06:14] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2025-06-01 02:06:14] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:06:14] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:06:14] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2025-06-01 02:06:14] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
[2025-06-01 02:06:16] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:06:16] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:06:16] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 119 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2025-06-01 02:06:20] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:06:20] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 2 ms to minimize.
[2025-06-01 02:06:20] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:06:22] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:06:23] [INFO ] Deduced a trap composed of 119 places in 330 ms of which 3 ms to minimize.
[2025-06-01 02:06:23] [INFO ] Deduced a trap composed of 116 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 113 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 127 places in 364 ms of which 5 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 4 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 103 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 112 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 101 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 104 places in 369 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2265 unsolved
[2025-06-01 02:06:27] [INFO ] Deduced a trap composed of 136 places in 355 ms of which 4 ms to minimize.
[2025-06-01 02:06:28] [INFO ] Deduced a trap composed of 114 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:06:28] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:06:28] [INFO ] Deduced a trap composed of 115 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:06:29] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:06:29] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:06:30] [INFO ] Deduced a trap composed of 144 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:06:30] [INFO ] Deduced a trap composed of 107 places in 343 ms of which 3 ms to minimize.
[2025-06-01 02:06:30] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 4 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 60 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 40 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 74 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:06:32] [INFO ] Deduced a trap composed of 129 places in 332 ms of which 3 ms to minimize.
[2025-06-01 02:06:32] [INFO ] Deduced a trap composed of 140 places in 369 ms of which 4 ms to minimize.
SMT process timed out in 76757ms, After SMT, problems are : Problem set: 0 solved, 2265 unsolved
Fused 2265 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 301 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 173 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 1242935 steps (0 resets) in 120004 ms. (10 steps per ms) remains 2263/2265 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2262/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2262/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2262/2262 properties
Interrupted probabilistic random walk after 836160 steps, run timeout after 93001 ms. (steps per millisecond=8 ) properties seen :0 out of 2262
Probabilistic random walk after 836160 steps, saw 584037 distinct states, run finished after 93002 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-01 02:08:37] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:08:37] [INFO ] Invariant cache hit.
[2025-06-01 02:08:37] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 74 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 8 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 62 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 98 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 34 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 4 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 3 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 102 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 89 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 110 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 127 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 78 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 78 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 43 places in 356 ms of which 4 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 108 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 3 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 79 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 106 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 72 places in 279 ms of which 3 ms to minimize.
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 2 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 101 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 70 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 3 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 108 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:09:44] [INFO ] Deduced a trap composed of 90 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:09:46] [INFO ] Deduced a trap composed of 92 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:09:46] [INFO ] Deduced a trap composed of 93 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:09:47] [INFO ] Deduced a trap composed of 97 places in 364 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:09:48] [INFO ] Deduced a trap composed of 49 places in 338 ms of which 4 ms to minimize.
[2025-06-01 02:09:51] [INFO ] Deduced a trap composed of 122 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:09:51] [INFO ] Deduced a trap composed of 109 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:09:52] [INFO ] Deduced a trap composed of 112 places in 313 ms of which 3 ms to minimize.
[2025-06-01 02:09:52] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:09:53] [INFO ] Deduced a trap composed of 138 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:09:53] [INFO ] Deduced a trap composed of 154 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:09:53] [INFO ] Deduced a trap composed of 146 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:09:54] [INFO ] Deduced a trap composed of 143 places in 351 ms of which 4 ms to minimize.
[2025-06-01 02:09:54] [INFO ] Deduced a trap composed of 177 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 103 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 112 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:09:55] [INFO ] Deduced a trap composed of 130 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 152 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:09:56] [INFO ] Deduced a trap composed of 154 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 155 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:09:57] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1964 variables, and 88 constraints, problems are : Problem set: 0 solved, 2262 unsolved in 90045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 2262/2262 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 112 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 3 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 201 places in 329 ms of which 3 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 192 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 132 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 148 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 136 places in 319 ms of which 3 ms to minimize.
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 128 places in 314 ms of which 4 ms to minimize.
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 3 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 3 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 102 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 106 places in 323 ms of which 4 ms to minimize.
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 128 places in 327 ms of which 3 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 112 places in 319 ms of which 3 ms to minimize.
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 144 places in 349 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:10:42] [INFO ] Deduced a trap composed of 105 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:10:42] [INFO ] Deduced a trap composed of 79 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:10:43] [INFO ] Deduced a trap composed of 138 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:10:43] [INFO ] Deduced a trap composed of 119 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 52 places in 376 ms of which 4 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 92 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 113 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:10:44] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:10:45] [INFO ] Deduced a trap composed of 137 places in 311 ms of which 4 ms to minimize.
[2025-06-01 02:10:45] [INFO ] Deduced a trap composed of 159 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 156 places in 287 ms of which 3 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 84 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 107 places in 328 ms of which 3 ms to minimize.
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 128 places in 412 ms of which 3 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 117 places in 400 ms of which 3 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 107 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 161 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 100 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 127 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 126 places in 417 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2025-06-01 02:10:57] [INFO ] Deduced a trap composed of 85 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:10:57] [INFO ] Deduced a trap composed of 101 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 118 places in 313 ms of which 3 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 87 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 119 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 128 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 103 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 79 places in 374 ms of which 4 ms to minimize.
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 92 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 82 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 115 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 129 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 105 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 110 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 96 places in 406 ms of which 4 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 4 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:11:06] [INFO ] Deduced a trap composed of 131 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:11:06] [INFO ] Deduced a trap composed of 84 places in 365 ms of which 4 ms to minimize.
[2025-06-01 02:11:06] [INFO ] Deduced a trap composed of 83 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:11:07] [INFO ] Deduced a trap composed of 81 places in 347 ms of which 4 ms to minimize.
[2025-06-01 02:11:07] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:11:07] [INFO ] Deduced a trap composed of 88 places in 371 ms of which 4 ms to minimize.
[2025-06-01 02:11:08] [INFO ] Deduced a trap composed of 119 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:11:09] [INFO ] Deduced a trap composed of 137 places in 329 ms of which 3 ms to minimize.
[2025-06-01 02:11:09] [INFO ] Deduced a trap composed of 96 places in 300 ms of which 3 ms to minimize.
[2025-06-01 02:11:09] [INFO ] Deduced a trap composed of 95 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 100 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 143 places in 315 ms of which 4 ms to minimize.
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 132 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 112 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 108 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 92 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 116 places in 277 ms of which 3 ms to minimize.
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 105 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 143 places in 312 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:11:15] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 97 places in 366 ms of which 4 ms to minimize.
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 111 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 103 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 105 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 145 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 129 places in 339 ms of which 3 ms to minimize.
[2025-06-01 02:11:22] [INFO ] Deduced a trap composed of 128 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:11:22] [INFO ] Deduced a trap composed of 113 places in 338 ms of which 4 ms to minimize.
[2025-06-01 02:11:22] [INFO ] Deduced a trap composed of 113 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:11:23] [INFO ] Deduced a trap composed of 112 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:11:23] [INFO ] Deduced a trap composed of 130 places in 373 ms of which 4 ms to minimize.
[2025-06-01 02:11:23] [INFO ] Deduced a trap composed of 122 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:11:24] [INFO ] Deduced a trap composed of 144 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:11:24] [INFO ] Deduced a trap composed of 116 places in 366 ms of which 4 ms to minimize.
[2025-06-01 02:11:25] [INFO ] Deduced a trap composed of 125 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:11:25] [INFO ] Deduced a trap composed of 128 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:11:25] [INFO ] Deduced a trap composed of 118 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 103 places in 328 ms of which 3 ms to minimize.
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 136 places in 332 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 2262 unsolved
[2025-06-01 02:11:35] [INFO ] Deduced a trap composed of 93 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:11:35] [INFO ] Deduced a trap composed of 111 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:11:36] [INFO ] Deduced a trap composed of 94 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:11:36] [INFO ] Deduced a trap composed of 116 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:11:36] [INFO ] Deduced a trap composed of 118 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:11:37] [INFO ] Deduced a trap composed of 103 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:11:37] [INFO ] Deduced a trap composed of 97 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:11:37] [INFO ] Deduced a trap composed of 107 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:11:38] [INFO ] Deduced a trap composed of 94 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:11:38] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:11:38] [INFO ] Deduced a trap composed of 70 places in 367 ms of which 3 ms to minimize.
SMT process timed out in 181928ms, After SMT, problems are : Problem set: 0 solved, 2262 unsolved
Fused 2262 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 301 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 120 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 1209963 steps (0 resets) in 120004 ms. (10 steps per ms) remains 2261/2262 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2261/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2260/2261 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2260/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2259/2260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2259/2259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2259/2259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2259/2259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2259/2259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2258/2259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2258/2258 properties
Interrupted probabilistic random walk after 808820 steps, run timeout after 96001 ms. (steps per millisecond=8 ) properties seen :0 out of 2258
Probabilistic random walk after 808820 steps, saw 565788 distinct states, run finished after 96001 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-01 02:13:47] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:13:47] [INFO ] Invariant cache hit.
[2025-06-01 02:13:47] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:14:41] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:14:41] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 4 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 161 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 33 places in 406 ms of which 4 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 60 places in 406 ms of which 4 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 135 places in 414 ms of which 4 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 97 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 154 places in 406 ms of which 3 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 163 places in 345 ms of which 4 ms to minimize.
[2025-06-01 02:14:45] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:14:45] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:14:46] [INFO ] Deduced a trap composed of 30 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:14:46] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 6 ms to minimize.
[2025-06-01 02:14:46] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 129 places in 382 ms of which 5 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 135 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:14:47] [INFO ] Deduced a trap composed of 138 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:14:48] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 3 ms to minimize.
[2025-06-01 02:14:48] [INFO ] Deduced a trap composed of 38 places in 377 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:14:50] [INFO ] Deduced a trap composed of 19 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:14:50] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 4 ms to minimize.
[2025-06-01 02:14:51] [INFO ] Deduced a trap composed of 114 places in 417 ms of which 4 ms to minimize.
[2025-06-01 02:14:51] [INFO ] Deduced a trap composed of 123 places in 410 ms of which 3 ms to minimize.
[2025-06-01 02:14:51] [INFO ] Deduced a trap composed of 113 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:14:52] [INFO ] Deduced a trap composed of 121 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:14:52] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 3 ms to minimize.
[2025-06-01 02:14:52] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:14:53] [INFO ] Deduced a trap composed of 156 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:14:53] [INFO ] Deduced a trap composed of 190 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:14:54] [INFO ] Deduced a trap composed of 135 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:14:54] [INFO ] Deduced a trap composed of 142 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:14:54] [INFO ] Deduced a trap composed of 126 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:14:55] [INFO ] Deduced a trap composed of 92 places in 346 ms of which 4 ms to minimize.
[2025-06-01 02:14:55] [INFO ] Deduced a trap composed of 128 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:14:55] [INFO ] Deduced a trap composed of 171 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:14:56] [INFO ] Deduced a trap composed of 135 places in 301 ms of which 3 ms to minimize.
[2025-06-01 02:14:56] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:14:56] [INFO ] Deduced a trap composed of 116 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:14:57] [INFO ] Deduced a trap composed of 131 places in 340 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:14:58] [INFO ] Deduced a trap composed of 48 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:14:59] [INFO ] Deduced a trap composed of 145 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:14:59] [INFO ] Deduced a trap composed of 146 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:14:59] [INFO ] Deduced a trap composed of 129 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:15:00] [INFO ] Deduced a trap composed of 157 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:15:00] [INFO ] Deduced a trap composed of 140 places in 355 ms of which 4 ms to minimize.
[2025-06-01 02:15:01] [INFO ] Deduced a trap composed of 158 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:15:01] [INFO ] Deduced a trap composed of 146 places in 367 ms of which 4 ms to minimize.
[2025-06-01 02:15:01] [INFO ] Deduced a trap composed of 118 places in 363 ms of which 4 ms to minimize.
[2025-06-01 02:15:02] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:15:02] [INFO ] Deduced a trap composed of 127 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:15:02] [INFO ] Deduced a trap composed of 97 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:15:03] [INFO ] Deduced a trap composed of 104 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:15:03] [INFO ] Deduced a trap composed of 114 places in 388 ms of which 6 ms to minimize.
[2025-06-01 02:15:04] [INFO ] Deduced a trap composed of 42 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:15:04] [INFO ] Deduced a trap composed of 141 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:15:04] [INFO ] Deduced a trap composed of 107 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:15:05] [INFO ] Deduced a trap composed of 171 places in 361 ms of which 4 ms to minimize.
[2025-06-01 02:15:05] [INFO ] Deduced a trap composed of 126 places in 368 ms of which 4 ms to minimize.
[2025-06-01 02:15:06] [INFO ] Deduced a trap composed of 107 places in 366 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:15:28] [INFO ] Deduced a trap composed of 3 places in 372 ms of which 4 ms to minimize.
[2025-06-01 02:15:29] [INFO ] Deduced a trap composed of 120 places in 376 ms of which 4 ms to minimize.
[2025-06-01 02:15:29] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 37 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:15:30] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 140 places in 335 ms of which 4 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:15:31] [INFO ] Deduced a trap composed of 138 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:15:32] [INFO ] Deduced a trap composed of 171 places in 384 ms of which 4 ms to minimize.
[2025-06-01 02:15:32] [INFO ] Deduced a trap composed of 103 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 146 places in 327 ms of which 3 ms to minimize.
[2025-06-01 02:15:33] [INFO ] Deduced a trap composed of 125 places in 332 ms of which 4 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 138 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:15:34] [INFO ] Deduced a trap composed of 127 places in 317 ms of which 3 ms to minimize.
SMT process timed out in 107146ms, After SMT, problems are : Problem set: 0 solved, 2258 unsolved
Fused 2258 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 301 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 120 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 607047 steps (0 resets) in 120004 ms. (5 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2258/2258 properties
Interrupted probabilistic random walk after 845510 steps, run timeout after 93001 ms. (steps per millisecond=9 ) properties seen :0 out of 2258
Probabilistic random walk after 845510 steps, saw 589697 distinct states, run finished after 93001 ms. (steps per millisecond=9 ) properties seen :0
[2025-06-01 02:17:38] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:17:38] [INFO ] Invariant cache hit.
[2025-06-01 02:17:39] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 38 places in 370 ms of which 4 ms to minimize.
[2025-06-01 02:18:33] [INFO ] Deduced a trap composed of 74 places in 359 ms of which 6 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 161 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 3 ms to minimize.
[2025-06-01 02:18:34] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:18:35] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 4 ms to minimize.
[2025-06-01 02:18:35] [INFO ] Deduced a trap composed of 135 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:18:36] [INFO ] Deduced a trap composed of 97 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:18:36] [INFO ] Deduced a trap composed of 154 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:18:36] [INFO ] Deduced a trap composed of 163 places in 328 ms of which 4 ms to minimize.
[2025-06-01 02:18:37] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 4 ms to minimize.
[2025-06-01 02:18:37] [INFO ] Deduced a trap composed of 3 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:18:37] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 24 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:18:38] [INFO ] Deduced a trap composed of 129 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 135 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 138 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:18:39] [INFO ] Deduced a trap composed of 27 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:18:40] [INFO ] Deduced a trap composed of 38 places in 360 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:18:41] [INFO ] Deduced a trap composed of 19 places in 415 ms of which 3 ms to minimize.
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 29 places in 355 ms of which 4 ms to minimize.
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 114 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:18:42] [INFO ] Deduced a trap composed of 123 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 113 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 121 places in 347 ms of which 4 ms to minimize.
[2025-06-01 02:18:43] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 4 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 156 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:18:44] [INFO ] Deduced a trap composed of 190 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:18:45] [INFO ] Deduced a trap composed of 135 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:18:45] [INFO ] Deduced a trap composed of 142 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:18:45] [INFO ] Deduced a trap composed of 126 places in 327 ms of which 4 ms to minimize.
[2025-06-01 02:18:46] [INFO ] Deduced a trap composed of 92 places in 309 ms of which 3 ms to minimize.
[2025-06-01 02:18:46] [INFO ] Deduced a trap composed of 128 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:18:46] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 3 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 135 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:18:47] [INFO ] Deduced a trap composed of 116 places in 325 ms of which 4 ms to minimize.
[2025-06-01 02:18:48] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:18:49] [INFO ] Deduced a trap composed of 48 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 145 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 146 places in 347 ms of which 4 ms to minimize.
[2025-06-01 02:18:50] [INFO ] Deduced a trap composed of 129 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:18:51] [INFO ] Deduced a trap composed of 157 places in 347 ms of which 4 ms to minimize.
[2025-06-01 02:18:51] [INFO ] Deduced a trap composed of 140 places in 343 ms of which 4 ms to minimize.
[2025-06-01 02:18:52] [INFO ] Deduced a trap composed of 158 places in 349 ms of which 4 ms to minimize.
[2025-06-01 02:18:52] [INFO ] Deduced a trap composed of 146 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:18:52] [INFO ] Deduced a trap composed of 118 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:18:53] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:18:53] [INFO ] Deduced a trap composed of 127 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:18:53] [INFO ] Deduced a trap composed of 97 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 104 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 114 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:18:54] [INFO ] Deduced a trap composed of 42 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 141 places in 364 ms of which 4 ms to minimize.
[2025-06-01 02:18:55] [INFO ] Deduced a trap composed of 107 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 171 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 126 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:18:56] [INFO ] Deduced a trap composed of 107 places in 367 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 120 places in 365 ms of which 4 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 37 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 37 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:19:21] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:19:21] [INFO ] Deduced a trap composed of 140 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 138 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 171 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 103 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 146 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 125 places in 339 ms of which 4 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 138 places in 330 ms of which 3 ms to minimize.
[2025-06-01 02:19:24] [INFO ] Deduced a trap composed of 127 places in 307 ms of which 3 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 144 places in 313 ms of which 3 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 115 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:19:25] [INFO ] Deduced a trap composed of 104 places in 291 ms of which 3 ms to minimize.
[2025-06-01 02:19:26] [INFO ] Deduced a trap composed of 118 places in 312 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 133 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 147 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 134 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 136 places in 368 ms of which 4 ms to minimize.
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 26 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 89 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 48 places in 357 ms of which 4 ms to minimize.
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 102 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 113 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 130 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 122 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 136 places in 344 ms of which 4 ms to minimize.
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 109 places in 319 ms of which 3 ms to minimize.
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 134 places in 329 ms of which 4 ms to minimize.
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 145 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 149 places in 339 ms of which 4 ms to minimize.
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 108 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 127 places in 348 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 67 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 4 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 21 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:19:39] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:19:39] [INFO ] Deduced a trap composed of 158 places in 330 ms of which 4 ms to minimize.
[2025-06-01 02:19:39] [INFO ] Deduced a trap composed of 153 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 168 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 166 places in 330 ms of which 3 ms to minimize.
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 160 places in 338 ms of which 3 ms to minimize.
SMT process timed out in 121924ms, After SMT, problems are : Problem set: 0 solved, 2258 unsolved
Fused 2258 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 301 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 117 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 551/551 places, 3492/3492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 113 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
[2025-06-01 02:19:41] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:19:41] [INFO ] Invariant cache hit.
[2025-06-01 02:19:41] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-01 02:19:41] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:19:41] [INFO ] Invariant cache hit.
[2025-06-01 02:19:41] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:19:43] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2025-06-01 02:19:43] [INFO ] Redundant transitions in 194 ms returned []
Running 3483 sub problems to find dead transitions.
[2025-06-01 02:19:43] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:19:43] [INFO ] Invariant cache hit.
[2025-06-01 02:19:43] [INFO ] State equation strengthened by 876 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/551 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3483 unsolved
SMT process timed out in 32491ms, After SMT, problems are : Problem set: 0 solved, 3483 unsolved
Search for dead transitions found 0 dead transitions in 32521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34806 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 400000 steps (8 resets) in 13857 ms. (28 steps per ms) remains 150/301 properties
Running SMT prover for 150 properties.
[2025-06-01 02:20:19] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:20:19] [INFO ] Invariant cache hit.
[2025-06-01 02:20:19] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2025-06-01 02:20:19] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2025-06-01 02:20:20] [INFO ] After 489ms SMT Verify possible using state equation in real domain returned unsat :0 sat :150
[2025-06-01 02:20:20] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:20:21] [INFO ] After 1181ms SMT Verify possible using 876 Read/Feed constraints in real domain returned unsat :0 sat :150
TRAPS : Iteration 0
[2025-06-01 02:20:33] [INFO ] After 12595ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:150
[2025-06-01 02:20:33] [INFO ] After 13321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:150
[2025-06-01 02:20:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-01 02:20:33] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-01 02:20:33] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :150
[2025-06-01 02:20:35] [INFO ] After 1479ms SMT Verify possible using 876 Read/Feed constraints in natural domain returned unsat :0 sat :150
TRAPS : Iteration 0
[2025-06-01 02:20:35] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:20:36] [INFO ] Deduced a trap composed of 93 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:20:36] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 3 ms to minimize.
[2025-06-01 02:20:36] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 3 ms to minimize.
[2025-06-01 02:20:36] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:20:37] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3443 ms
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-06-01 02:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-06-01 02:20:39] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:20:40] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:20:40] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:20:40] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:20:40] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:20:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 909 ms
[2025-06-01 02:20:41] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2025-06-01 02:20:41] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-01 02:20:41] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2025-06-01 02:20:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-06-01 02:20:42] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-01 02:20:43] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-01 02:20:44] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2025-06-01 02:20:46] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:20:46] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 2 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:20:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1379 ms
[2025-06-01 02:20:47] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2025-06-01 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-06-01 02:20:48] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:20:48] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:20:48] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:20:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2025-06-01 02:20:49] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:20:49] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2025-06-01 02:20:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2025-06-01 02:20:49] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2025-06-01 02:20:50] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:20:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2025-06-01 02:20:51] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-01 02:20:52] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2025-06-01 02:20:53] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2025-06-01 02:20:53] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:20:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2025-06-01 02:20:55] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:20:55] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:20:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2025-06-01 02:20:55] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:20:55] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:20:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
TRAPS : Iteration 1
[2025-06-01 02:20:56] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2025-06-01 02:20:56] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:20:56] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:20:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2025-06-01 02:20:56] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:20:57] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2025-06-01 02:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2025-06-01 02:20:57] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:20:57] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2025-06-01 02:20:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-01 02:20:58] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-06-01 02:21:00] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:21:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:21:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2025-06-01 02:21:01] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-01 02:21:04] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:21:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2025-06-01 02:21:05] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-06-01 02:21:09] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2025-06-01 02:21:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
TRAPS : Iteration 2
[2025-06-01 02:21:11] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2025-06-01 02:21:12] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2025-06-01 02:21:16] [INFO ] Deduced a trap composed of 104 places in 292 ms of which 3 ms to minimize.
[2025-06-01 02:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2025-06-01 02:21:17] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 4 ms to minimize.
[2025-06-01 02:21:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2025-06-01 02:21:18] [INFO ] Deduced a trap composed of 62 places in 319 ms of which 3 ms to minimize.
[2025-06-01 02:21:18] [INFO ] Deduced a trap composed of 94 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 781 ms
TRAPS : Iteration 3
[2025-06-01 02:21:35] [INFO ] After 61953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :150
[2025-06-01 02:21:37] [INFO ] After 64340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :150
RANDOM walk for 566013 steps (0 resets) in 120004 ms. (4 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2258/2258 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2258/2258 properties
Interrupted probabilistic random walk after 790100 steps, run timeout after 93001 ms. (steps per millisecond=8 ) properties seen :0 out of 2258
Probabilistic random walk after 790100 steps, saw 552795 distinct states, run finished after 93005 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-01 02:23:41] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:23:41] [INFO ] Invariant cache hit.
[2025-06-01 02:23:41] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:24:34] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 4 ms to minimize.
[2025-06-01 02:24:35] [INFO ] Deduced a trap composed of 74 places in 399 ms of which 4 ms to minimize.
[2025-06-01 02:24:35] [INFO ] Deduced a trap composed of 161 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:24:36] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:24:36] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:24:36] [INFO ] Deduced a trap composed of 60 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:24:37] [INFO ] Deduced a trap composed of 135 places in 389 ms of which 4 ms to minimize.
[2025-06-01 02:24:37] [INFO ] Deduced a trap composed of 97 places in 372 ms of which 4 ms to minimize.
[2025-06-01 02:24:38] [INFO ] Deduced a trap composed of 154 places in 371 ms of which 4 ms to minimize.
[2025-06-01 02:24:38] [INFO ] Deduced a trap composed of 163 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:24:38] [INFO ] Deduced a trap composed of 26 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:24:39] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:24:39] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:24:39] [INFO ] Deduced a trap composed of 52 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:24:40] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 4 ms to minimize.
[2025-06-01 02:24:40] [INFO ] Deduced a trap composed of 129 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:24:41] [INFO ] Deduced a trap composed of 135 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:24:41] [INFO ] Deduced a trap composed of 138 places in 335 ms of which 4 ms to minimize.
[2025-06-01 02:24:41] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:24:42] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 19 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:24:43] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:24:44] [INFO ] Deduced a trap composed of 114 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:24:44] [INFO ] Deduced a trap composed of 123 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 113 places in 343 ms of which 3 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 121 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:24:45] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 6 ms to minimize.
[2025-06-01 02:24:46] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:24:46] [INFO ] Deduced a trap composed of 156 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:24:46] [INFO ] Deduced a trap composed of 190 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:24:47] [INFO ] Deduced a trap composed of 135 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:24:47] [INFO ] Deduced a trap composed of 142 places in 336 ms of which 4 ms to minimize.
[2025-06-01 02:24:47] [INFO ] Deduced a trap composed of 126 places in 339 ms of which 4 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 92 places in 325 ms of which 4 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 128 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:24:48] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 3 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 135 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:24:49] [INFO ] Deduced a trap composed of 116 places in 328 ms of which 3 ms to minimize.
[2025-06-01 02:24:50] [INFO ] Deduced a trap composed of 131 places in 348 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:24:51] [INFO ] Deduced a trap composed of 48 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 145 places in 376 ms of which 4 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 146 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:24:52] [INFO ] Deduced a trap composed of 129 places in 361 ms of which 4 ms to minimize.
[2025-06-01 02:24:53] [INFO ] Deduced a trap composed of 157 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:24:53] [INFO ] Deduced a trap composed of 140 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:24:54] [INFO ] Deduced a trap composed of 158 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:24:54] [INFO ] Deduced a trap composed of 146 places in 363 ms of which 4 ms to minimize.
[2025-06-01 02:24:54] [INFO ] Deduced a trap composed of 118 places in 361 ms of which 4 ms to minimize.
[2025-06-01 02:24:55] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:24:55] [INFO ] Deduced a trap composed of 127 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:24:55] [INFO ] Deduced a trap composed of 97 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:24:56] [INFO ] Deduced a trap composed of 104 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:24:56] [INFO ] Deduced a trap composed of 114 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:24:57] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:24:57] [INFO ] Deduced a trap composed of 141 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:24:57] [INFO ] Deduced a trap composed of 107 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:24:58] [INFO ] Deduced a trap composed of 171 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:24:58] [INFO ] Deduced a trap composed of 126 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:24:59] [INFO ] Deduced a trap composed of 107 places in 386 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:25:21] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 4 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 120 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 36 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 15 places in 348 ms of which 4 ms to minimize.
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 140 places in 322 ms of which 4 ms to minimize.
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 138 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 171 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 103 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:25:25] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 3 ms to minimize.
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 146 places in 314 ms of which 4 ms to minimize.
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 138 places in 323 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 127 places in 311 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 144 places in 304 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 115 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 104 places in 276 ms of which 3 ms to minimize.
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 118 places in 303 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 133 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:25:30] [INFO ] Deduced a trap composed of 147 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 134 places in 327 ms of which 3 ms to minimize.
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 136 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:25:31] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 89 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 48 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 102 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 113 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 130 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 122 places in 420 ms of which 3 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 136 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 109 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 134 places in 337 ms of which 4 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 145 places in 343 ms of which 4 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 149 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 108 places in 339 ms of which 3 ms to minimize.
[2025-06-01 02:25:37] [INFO ] Deduced a trap composed of 127 places in 338 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:25:39] [INFO ] Deduced a trap composed of 67 places in 340 ms of which 4 ms to minimize.
[2025-06-01 02:25:39] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:25:40] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:25:40] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:25:40] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:25:41] [INFO ] Deduced a trap composed of 27 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:25:41] [INFO ] Deduced a trap composed of 158 places in 333 ms of which 4 ms to minimize.
[2025-06-01 02:25:42] [INFO ] Deduced a trap composed of 153 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:25:42] [INFO ] Deduced a trap composed of 168 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:25:42] [INFO ] Deduced a trap composed of 166 places in 333 ms of which 4 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 160 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:25:44] [INFO ] Deduced a trap composed of 146 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:25:44] [INFO ] Deduced a trap composed of 100 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:25:45] [INFO ] Deduced a trap composed of 102 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:25:45] [INFO ] Deduced a trap composed of 129 places in 368 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 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 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.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 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.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 0.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 1.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 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1964 variables, and 148 constraints, problems are : Problem set: 0 solved, 2258 unsolved in 135049 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 2258/2258 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 2 (OVERLAPS) 250/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 120/148 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 57 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 108 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 77 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 117 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 86 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:26:27] [INFO ] Deduced a trap composed of 96 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 94 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 94 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:26:28] [INFO ] Deduced a trap composed of 106 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:26:29] [INFO ] Deduced a trap composed of 98 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:26:29] [INFO ] Deduced a trap composed of 110 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:26:30] [INFO ] Deduced a trap composed of 123 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:26:30] [INFO ] Deduced a trap composed of 98 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:26:30] [INFO ] Deduced a trap composed of 85 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:26:31] [INFO ] Deduced a trap composed of 16 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:26:31] [INFO ] Deduced a trap composed of 129 places in 359 ms of which 4 ms to minimize.
[2025-06-01 02:26:31] [INFO ] Deduced a trap composed of 132 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:26:32] [INFO ] Deduced a trap composed of 117 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:26:32] [INFO ] Deduced a trap composed of 84 places in 359 ms of which 4 ms to minimize.
[2025-06-01 02:26:33] [INFO ] Deduced a trap composed of 116 places in 345 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:26:39] [INFO ] Deduced a trap composed of 99 places in 363 ms of which 4 ms to minimize.
[2025-06-01 02:26:39] [INFO ] Deduced a trap composed of 100 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:26:39] [INFO ] Deduced a trap composed of 99 places in 339 ms of which 3 ms to minimize.
[2025-06-01 02:26:40] [INFO ] Deduced a trap composed of 139 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:26:40] [INFO ] Deduced a trap composed of 129 places in 314 ms of which 3 ms to minimize.
[2025-06-01 02:26:40] [INFO ] Deduced a trap composed of 105 places in 301 ms of which 3 ms to minimize.
[2025-06-01 02:26:41] [INFO ] Deduced a trap composed of 93 places in 309 ms of which 3 ms to minimize.
[2025-06-01 02:26:41] [INFO ] Deduced a trap composed of 99 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:26:42] [INFO ] Deduced a trap composed of 108 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:26:42] [INFO ] Deduced a trap composed of 131 places in 328 ms of which 4 ms to minimize.
[2025-06-01 02:26:42] [INFO ] Deduced a trap composed of 135 places in 322 ms of which 3 ms to minimize.
[2025-06-01 02:26:43] [INFO ] Deduced a trap composed of 142 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:26:43] [INFO ] Deduced a trap composed of 119 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:26:43] [INFO ] Deduced a trap composed of 153 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:26:44] [INFO ] Deduced a trap composed of 161 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:26:44] [INFO ] Deduced a trap composed of 118 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:26:44] [INFO ] Deduced a trap composed of 108 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:26:45] [INFO ] Deduced a trap composed of 134 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:26:45] [INFO ] Deduced a trap composed of 132 places in 329 ms of which 4 ms to minimize.
[2025-06-01 02:26:45] [INFO ] Deduced a trap composed of 115 places in 360 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:26:48] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2025-06-01 02:26:48] [INFO ] Deduced a trap composed of 70 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 138 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 111 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:26:49] [INFO ] Deduced a trap composed of 135 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:26:50] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2025-06-01 02:26:50] [INFO ] Deduced a trap composed of 58 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:26:50] [INFO ] Deduced a trap composed of 56 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:26:51] [INFO ] Deduced a trap composed of 55 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:26:51] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:26:51] [INFO ] Deduced a trap composed of 108 places in 312 ms of which 2 ms to minimize.
[2025-06-01 02:26:52] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 3 ms to minimize.
[2025-06-01 02:26:52] [INFO ] Deduced a trap composed of 115 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:26:53] [INFO ] Deduced a trap composed of 96 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:26:54] [INFO ] Deduced a trap composed of 87 places in 332 ms of which 3 ms to minimize.
[2025-06-01 02:26:54] [INFO ] Deduced a trap composed of 93 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:26:55] [INFO ] Deduced a trap composed of 100 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:26:56] [INFO ] Deduced a trap composed of 93 places in 368 ms of which 4 ms to minimize.
[2025-06-01 02:26:56] [INFO ] Deduced a trap composed of 88 places in 355 ms of which 4 ms to minimize.
[2025-06-01 02:26:57] [INFO ] Deduced a trap composed of 122 places in 365 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:27:00] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:27:00] [INFO ] Deduced a trap composed of 139 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:27:01] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:27:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:27:03] [INFO ] Deduced a trap composed of 147 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:27:03] [INFO ] Deduced a trap composed of 120 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:27:03] [INFO ] Deduced a trap composed of 125 places in 299 ms of which 3 ms to minimize.
[2025-06-01 02:27:04] [INFO ] Deduced a trap composed of 153 places in 316 ms of which 3 ms to minimize.
[2025-06-01 02:27:04] [INFO ] Deduced a trap composed of 155 places in 301 ms of which 3 ms to minimize.
[2025-06-01 02:27:05] [INFO ] Deduced a trap composed of 126 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:27:06] [INFO ] Deduced a trap composed of 155 places in 335 ms of which 4 ms to minimize.
[2025-06-01 02:27:06] [INFO ] Deduced a trap composed of 127 places in 301 ms of which 3 ms to minimize.
[2025-06-01 02:27:07] [INFO ] Deduced a trap composed of 152 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:27:07] [INFO ] Deduced a trap composed of 134 places in 329 ms of which 3 ms to minimize.
[2025-06-01 02:27:09] [INFO ] Deduced a trap composed of 98 places in 384 ms of which 4 ms to minimize.
[2025-06-01 02:27:09] [INFO ] Deduced a trap composed of 137 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:27:10] [INFO ] Deduced a trap composed of 134 places in 374 ms of which 4 ms to minimize.
[2025-06-01 02:27:10] [INFO ] Deduced a trap composed of 96 places in 372 ms of which 4 ms to minimize.
[2025-06-01 02:27:10] [INFO ] Deduced a trap composed of 125 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:27:11] [INFO ] Deduced a trap composed of 92 places in 370 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:27:14] [INFO ] Deduced a trap composed of 114 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:27:14] [INFO ] Deduced a trap composed of 158 places in 349 ms of which 3 ms to minimize.
[2025-06-01 02:27:15] [INFO ] Deduced a trap composed of 122 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:27:15] [INFO ] Deduced a trap composed of 106 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:27:16] [INFO ] Deduced a trap composed of 85 places in 231 ms of which 3 ms to minimize.
[2025-06-01 02:27:20] [INFO ] Deduced a trap composed of 117 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:27:21] [INFO ] Deduced a trap composed of 114 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:27:21] [INFO ] Deduced a trap composed of 91 places in 344 ms of which 4 ms to minimize.
[2025-06-01 02:27:22] [INFO ] Deduced a trap composed of 85 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:27:22] [INFO ] Deduced a trap composed of 88 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:27:23] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:27:23] [INFO ] Deduced a trap composed of 118 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:27:23] [INFO ] Deduced a trap composed of 110 places in 416 ms of which 4 ms to minimize.
[2025-06-01 02:27:24] [INFO ] Deduced a trap composed of 57 places in 323 ms of which 3 ms to minimize.
[2025-06-01 02:27:24] [INFO ] Deduced a trap composed of 140 places in 363 ms of which 4 ms to minimize.
[2025-06-01 02:27:25] [INFO ] Deduced a trap composed of 128 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:27:25] [INFO ] Deduced a trap composed of 113 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:27:26] [INFO ] Deduced a trap composed of 134 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:27:26] [INFO ] Deduced a trap composed of 112 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:27:27] [INFO ] Deduced a trap composed of 107 places in 397 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:27:30] [INFO ] Deduced a trap composed of 93 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:27:35] [INFO ] Deduced a trap composed of 90 places in 399 ms of which 3 ms to minimize.
[2025-06-01 02:27:35] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 4 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 93 places in 400 ms of which 4 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 64 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:27:38] [INFO ] Deduced a trap composed of 112 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:27:38] [INFO ] Deduced a trap composed of 96 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:27:38] [INFO ] Deduced a trap composed of 111 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:27:39] [INFO ] Deduced a trap composed of 107 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:27:39] [INFO ] Deduced a trap composed of 112 places in 401 ms of which 3 ms to minimize.
[2025-06-01 02:27:40] [INFO ] Deduced a trap composed of 102 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:27:41] [INFO ] Deduced a trap composed of 94 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:27:41] [INFO ] Deduced a trap composed of 111 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 86 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 126 places in 314 ms of which 3 ms to minimize.
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 150 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:27:43] [INFO ] Deduced a trap composed of 132 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:27:43] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 3 ms to minimize.
[2025-06-01 02:27:44] [INFO ] Deduced a trap composed of 112 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:27:44] [INFO ] Deduced a trap composed of 89 places in 345 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:27:48] [INFO ] Deduced a trap composed of 134 places in 348 ms of which 4 ms to minimize.
[2025-06-01 02:27:48] [INFO ] Deduced a trap composed of 120 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:27:48] [INFO ] Deduced a trap composed of 118 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:27:49] [INFO ] Deduced a trap composed of 131 places in 335 ms of which 4 ms to minimize.
[2025-06-01 02:27:49] [INFO ] Deduced a trap composed of 129 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:27:49] [INFO ] Deduced a trap composed of 99 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:27:50] [INFO ] Deduced a trap composed of 113 places in 280 ms of which 3 ms to minimize.
[2025-06-01 02:27:50] [INFO ] Deduced a trap composed of 130 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:27:50] [INFO ] Deduced a trap composed of 161 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 110 places in 332 ms of which 3 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 126 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 164 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:27:52] [INFO ] Deduced a trap composed of 103 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:27:52] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:27:52] [INFO ] Deduced a trap composed of 160 places in 285 ms of which 2 ms to minimize.
[2025-06-01 02:27:53] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 2 ms to minimize.
[2025-06-01 02:27:53] [INFO ] Deduced a trap composed of 115 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:27:53] [INFO ] Deduced a trap composed of 131 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:27:54] [INFO ] Deduced a trap composed of 134 places in 339 ms of which 4 ms to minimize.
[2025-06-01 02:27:54] [INFO ] Deduced a trap composed of 106 places in 336 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:28:01] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:28:02] [INFO ] Deduced a trap composed of 167 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:28:02] [INFO ] Deduced a trap composed of 140 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:28:02] [INFO ] Deduced a trap composed of 120 places in 287 ms of which 2 ms to minimize.
[2025-06-01 02:28:02] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2025-06-01 02:28:02] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:28:03] [INFO ] Deduced a trap composed of 124 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:28:03] [INFO ] Deduced a trap composed of 106 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:28:04] [INFO ] Deduced a trap composed of 125 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:28:04] [INFO ] Deduced a trap composed of 159 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:28:04] [INFO ] Deduced a trap composed of 138 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:28:05] [INFO ] Deduced a trap composed of 115 places in 343 ms of which 3 ms to minimize.
[2025-06-01 02:28:05] [INFO ] Deduced a trap composed of 113 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:28:05] [INFO ] Deduced a trap composed of 131 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:28:06] [INFO ] Deduced a trap composed of 113 places in 323 ms of which 3 ms to minimize.
[2025-06-01 02:28:06] [INFO ] Deduced a trap composed of 131 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:28:07] [INFO ] Deduced a trap composed of 143 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:28:07] [INFO ] Deduced a trap composed of 125 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:28:07] [INFO ] Deduced a trap composed of 90 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:28:08] [INFO ] Deduced a trap composed of 91 places in 366 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 2258 unsolved
[2025-06-01 02:28:12] [INFO ] Deduced a trap composed of 126 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:28:13] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1964 variables, and 310 constraints, problems are : Problem set: 0 solved, 2258 unsolved in 135035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 0/2258 constraints, Known Traps: 282/282 constraints]
After SMT, in 272019ms problems are : Problem set: 0 solved, 2258 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 301 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 110 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 551/551 places, 3492/3492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 111 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
[2025-06-01 02:28:14] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:28:14] [INFO ] Invariant cache hit.
[2025-06-01 02:28:14] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-01 02:28:14] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:28:14] [INFO ] Invariant cache hit.
[2025-06-01 02:28:14] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:28:15] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2025-06-01 02:28:16] [INFO ] Redundant transitions in 204 ms returned []
Running 3483 sub problems to find dead transitions.
[2025-06-01 02:28:16] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:28:16] [INFO ] Invariant cache hit.
[2025-06-01 02:28:16] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3483 unsolved
SMT process timed out in 32332ms, After SMT, problems are : Problem set: 0 solved, 3483 unsolved
Search for dead transitions found 0 dead transitions in 32361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34459 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 400000 steps (8 resets) in 5238 ms. (76 steps per ms) remains 149/301 properties
Running SMT prover for 149 properties.
[2025-06-01 02:28:49] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:28:49] [INFO ] Invariant cache hit.
[2025-06-01 02:28:49] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-01 02:28:50] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-01 02:28:50] [INFO ] After 482ms SMT Verify possible using state equation in real domain returned unsat :0 sat :149
[2025-06-01 02:28:50] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:28:51] [INFO ] After 1070ms SMT Verify possible using 876 Read/Feed constraints in real domain returned unsat :0 sat :149
TRAPS : Iteration 0
[2025-06-01 02:29:02] [INFO ] After 12130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:149
[2025-06-01 02:29:02] [INFO ] After 12803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:149
[2025-06-01 02:29:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-01 02:29:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-01 02:29:03] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :149
[2025-06-01 02:29:04] [INFO ] After 1400ms SMT Verify possible using 876 Read/Feed constraints in natural domain returned unsat :0 sat :149
TRAPS : Iteration 0
[2025-06-01 02:29:05] [INFO ] Deduced a trap composed of 112 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:29:05] [INFO ] Deduced a trap composed of 167 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:29:06] [INFO ] Deduced a trap composed of 32 places in 386 ms of which 4 ms to minimize.
[2025-06-01 02:29:06] [INFO ] Deduced a trap composed of 44 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:29:06] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 4 ms to minimize.
[2025-06-01 02:29:07] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 4 ms to minimize.
[2025-06-01 02:29:07] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 3 ms to minimize.
[2025-06-01 02:29:07] [INFO ] Deduced a trap composed of 174 places in 319 ms of which 3 ms to minimize.
[2025-06-01 02:29:08] [INFO ] Deduced a trap composed of 128 places in 314 ms of which 2 ms to minimize.
[2025-06-01 02:29:08] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:29:09] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:29:09] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 3 ms to minimize.
[2025-06-01 02:29:09] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:29:10] [INFO ] Deduced a trap composed of 85 places in 322 ms of which 3 ms to minimize.
[2025-06-01 02:29:10] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 3 ms to minimize.
[2025-06-01 02:29:10] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 3 ms to minimize.
[2025-06-01 02:29:11] [INFO ] Deduced a trap composed of 125 places in 298 ms of which 3 ms to minimize.
[2025-06-01 02:29:11] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 2 ms to minimize.

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-09"
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-09, 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-174860080700502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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