MCC'2024- Execution of r494-smll-171636275100127

About the Execution of LTSMin+red for EisenbergMcGuire-PT-10

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r494-smll-171636275100127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r494-smll-171636275100127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 1717230104933

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 08:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:21:48] [INFO ] Load time of PNML (sax parser for PT used): 752 ms
[2024-06-01 08:21:48] [INFO ] Transformed 1090 places.
[2024-06-01 08:21:48] [INFO ] Transformed 5200 transitions.
[2024-06-01 08:21:48] [INFO ] Found NUPN structural information;
[2024-06-01 08:21:48] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 1050 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1080 transition count 4880
Deduced a syphon composed of 310 places in 60 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 770 transition count 4880
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 26 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 680 transition count 4790
Applied a total of 820 rules in 584 ms. Remains 680 /1090 variables (removed 410) and now considering 4790/5200 (removed 410) transitions.
[2024-06-01 08:21:49] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:21:49] [INFO ] Computed 31 invariants in 63 ms
[2024-06-01 08:21:52] [INFO ] Implicit Places using invariants in 2937 ms returned []
[2024-06-01 08:21:52] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:21:52] [INFO ] Invariant cache hit.
[2024-06-01 08:21:53] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-06-01 08:22:05] [INFO ] Implicit Places using invariants and state equation in 12765 ms returned []
Implicit Place search using SMT with State Equation took 15769 ms to find 0 implicit places.
Running 4780 sub problems to find dead transitions.
[2024-06-01 08:22:05] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:22:05] [INFO ] Invariant cache hit.
[2024-06-01 08:22:05] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 680/680 constraints. Problems are: Problem set: 0 solved, 4780 unsolved
SMT process timed out in 35839ms, After SMT, problems are : Problem set: 0 solved, 4780 unsolved
Search for dead transitions found 0 dead transitions in 35943ms
Starting structural reductions in LIVENESS mode, iteration 1 : 680/1090 places, 4790/5200 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 52378 ms. Remains : 680/1090 places, 4790/5200 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 24097 ms. (1 steps per ms) remains 4111/4780 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 4111/4111 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 4111/4111 properties
[2024-06-01 08:22:48] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:22:48] [INFO ] Invariant cache hit.
[2024-06-01 08:22:48] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 533/533 constraints. Problems are: Problem set: 0 solved, 4111 unsolved
SMT process timed out in 10103ms, After SMT, problems are : Problem set: 0 solved, 4111 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 533 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 513 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 396544 steps (0 resets) in 120004 ms. (3 steps per ms) remains 4090/4111 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4090/4090 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4089/4090 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 4089/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4088/4089 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4087/4088 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4085/4087 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4085/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4084/4085 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4083/4084 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4082/4083 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4082/4082 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4082/4082 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4082/4082 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4081/4082 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4081/4081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4081/4081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4081/4081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4081/4081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4080/4081 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4079/4080 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4079/4079 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4078/4079 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4076/4078 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4076/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4075/4076 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4075/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4074/4075 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4074/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4073/4074 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4073/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4072/4073 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4072/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4072/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 242 ms. (16 steps per ms) remains 4072/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4071/4072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 4071/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4070/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4069/4070 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4069/4069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4067/4069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4067/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4066/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4065/4066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4065/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4064/4065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4064/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4063/4064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4063/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4062/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4062 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4061/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4060/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 243 ms. (16 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 4059/4059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 4059/4059 properties
Interrupted probabilistic random walk after 509531 steps, run timeout after 111003 ms. (steps per millisecond=4 ) properties seen :648 out of 4059
Probabilistic random walk after 509531 steps, saw 386054 distinct states, run finished after 111022 ms. (steps per millisecond=4 ) properties seen :648
[2024-06-01 08:25:27] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:25:27] [INFO ] Invariant cache hit.
[2024-06-01 08:25:27] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
SMT process timed out in 48919ms, After SMT, problems are : Problem set: 0 solved, 3411 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 431 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 431 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 486140 steps (0 resets) in 120004 ms. (4 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 249 ms. (16 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 3411/3411 properties
Interrupted probabilistic random walk after 451924 steps, run timeout after 93001 ms. (steps per millisecond=4 ) properties seen :0 out of 3411
Probabilistic random walk after 451924 steps, saw 343717 distinct states, run finished after 93004 ms. (steps per millisecond=4 ) properties seen :0
[2024-06-01 08:28:21] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:28:21] [INFO ] Invariant cache hit.
[2024-06-01 08:28:21] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2600 variables, and 432 constraints, problems are : Problem set: 0 solved, 3411 unsolved in 75102 ms.
Refiners :[Domain max(s): 431/680 constraints, Positive P Invariants (semi-flows): 1/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/680 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 3411/3411 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
SMT process timed out in 154274ms, After SMT, problems are : Problem set: 0 solved, 3411 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 431 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 453 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 680/680 places, 4790/4790 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 266 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
[2024-06-01 08:30:56] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:30:56] [INFO ] Invariant cache hit.
[2024-06-01 08:30:57] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-06-01 08:30:57] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:30:57] [INFO ] Invariant cache hit.
[2024-06-01 08:30:58] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-06-01 08:31:01] [INFO ] Implicit Places using invariants and state equation in 4235 ms returned []
Implicit Place search using SMT with State Equation took 4670 ms to find 0 implicit places.
[2024-06-01 08:31:02] [INFO ] Redundant transitions in 750 ms returned []
Running 4780 sub problems to find dead transitions.
[2024-06-01 08:31:02] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:31:02] [INFO ] Invariant cache hit.
[2024-06-01 08:31:02] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 680/680 constraints. Problems are: Problem set: 0 solved, 4780 unsolved
SMT process timed out in 35556ms, After SMT, problems are : Problem set: 0 solved, 4780 unsolved
Search for dead transitions found 0 dead transitions in 35659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41369 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 400000 steps (8 resets) in 11209 ms. (35 steps per ms) remains 206/431 properties
Running SMT prover for 206 properties.
[2024-06-01 08:31:41] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:31:41] [INFO ] Invariant cache hit.
[2024-06-01 08:31:41] [INFO ] [Real]Absence check using 21 positive place invariants in 33 ms returned sat
[2024-06-01 08:31:41] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2024-06-01 08:31:43] [INFO ] After 1451ms SMT Verify possible using state equation in real domain returned unsat :0 sat :206
[2024-06-01 08:31:43] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-06-01 08:31:46] [INFO ] After 3119ms SMT Verify possible using 1246 Read/Feed constraints in real domain returned unsat :0 sat :206
TRAPS : Iteration 0
[2024-06-01 08:32:23] [INFO ] After 40189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:206
[2024-06-01 08:32:23] [INFO ] After 42304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:206
[2024-06-01 08:32:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2024-06-01 08:32:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2024-06-01 08:32:25] [INFO ] After 1664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :206
[2024-06-01 08:32:31] [INFO ] After 5139ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :206
TRAPS : Iteration 0
[2024-06-01 08:32:32] [INFO ] Deduced a trap composed of 3 places in 1267 ms of which 91 ms to minimize.
[2024-06-01 08:32:33] [INFO ] Deduced a trap composed of 3 places in 1087 ms of which 10 ms to minimize.
[2024-06-01 08:32:34] [INFO ] Deduced a trap composed of 3 places in 1177 ms of which 14 ms to minimize.
[2024-06-01 08:32:35] [INFO ] Deduced a trap composed of 33 places in 702 ms of which 8 ms to minimize.
[2024-06-01 08:32:36] [INFO ] Deduced a trap composed of 43 places in 801 ms of which 7 ms to minimize.
[2024-06-01 08:32:37] [INFO ] Deduced a trap composed of 3 places in 897 ms of which 9 ms to minimize.
[2024-06-01 08:32:38] [INFO ] Deduced a trap composed of 89 places in 858 ms of which 7 ms to minimize.
[2024-06-01 08:32:39] [INFO ] Deduced a trap composed of 71 places in 768 ms of which 7 ms to minimize.
[2024-06-01 08:32:40] [INFO ] Deduced a trap composed of 86 places in 863 ms of which 8 ms to minimize.
[2024-06-01 08:32:41] [INFO ] Deduced a trap composed of 22 places in 852 ms of which 7 ms to minimize.
[2024-06-01 08:32:41] [INFO ] Deduced a trap composed of 25 places in 352 ms of which 4 ms to minimize.
[2024-06-01 08:32:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 10878 ms
[2024-06-01 08:32:43] [INFO ] Deduced a trap composed of 6 places in 1241 ms of which 9 ms to minimize.
[2024-06-01 08:32:44] [INFO ] Deduced a trap composed of 77 places in 624 ms of which 5 ms to minimize.
[2024-06-01 08:32:44] [INFO ] Deduced a trap composed of 39 places in 633 ms of which 5 ms to minimize.
[2024-06-01 08:32:45] [INFO ] Deduced a trap composed of 58 places in 643 ms of which 5 ms to minimize.
[2024-06-01 08:32:46] [INFO ] Deduced a trap composed of 35 places in 544 ms of which 6 ms to minimize.
[2024-06-01 08:32:47] [INFO ] Deduced a trap composed of 35 places in 641 ms of which 6 ms to minimize.
[2024-06-01 08:32:47] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 3 ms to minimize.
[2024-06-01 08:32:47] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 1 ms to minimize.
[2024-06-01 08:32:47] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6007 ms
[2024-06-01 08:32:48] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2024-06-01 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2024-06-01 08:32:48] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-06-01 08:32:49] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:32:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-06-01 08:32:50] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 4 ms to minimize.
[2024-06-01 08:32:51] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 5 ms to minimize.
[2024-06-01 08:32:51] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 4 ms to minimize.
[2024-06-01 08:32:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1662 ms
[2024-06-01 08:32:54] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 3 ms to minimize.
[2024-06-01 08:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2024-06-01 08:32:57] [INFO ] Deduced a trap composed of 109 places in 1075 ms of which 9 ms to minimize.
[2024-06-01 08:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1324 ms
[2024-06-01 08:32:58] [INFO ] Deduced a trap composed of 41 places in 360 ms of which 3 ms to minimize.
[2024-06-01 08:32:59] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 3 ms to minimize.
[2024-06-01 08:32:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1080 ms
[2024-06-01 08:33:00] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 4 ms to minimize.
[2024-06-01 08:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2024-06-01 08:33:03] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 4 ms to minimize.
[2024-06-01 08:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 617 ms
[2024-06-01 08:33:06] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 4 ms to minimize.
[2024-06-01 08:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2024-06-01 08:33:06] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2024-06-01 08:33:10] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 4 ms to minimize.
[2024-06-01 08:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2024-06-01 08:33:13] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
[2024-06-01 08:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2024-06-01 08:33:13] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 2 ms to minimize.
[2024-06-01 08:33:14] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 3 ms to minimize.
[2024-06-01 08:33:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 853 ms
[2024-06-01 08:33:15] [INFO ] Deduced a trap composed of 19 places in 731 ms of which 7 ms to minimize.
[2024-06-01 08:33:15] [INFO ] Deduced a trap composed of 21 places in 585 ms of which 5 ms to minimize.
[2024-06-01 08:33:16] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 5 ms to minimize.
[2024-06-01 08:33:16] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 4 ms to minimize.
[2024-06-01 08:33:17] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:33:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3057 ms
[2024-06-01 08:33:17] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 3 ms to minimize.
[2024-06-01 08:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2024-06-01 08:33:18] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 3 ms to minimize.
[2024-06-01 08:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2024-06-01 08:33:21] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 2 ms to minimize.
[2024-06-01 08:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2024-06-01 08:33:22] [INFO ] Deduced a trap composed of 56 places in 241 ms of which 2 ms to minimize.
[2024-06-01 08:33:22] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 2 ms to minimize.
[2024-06-01 08:33:23] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 2 ms to minimize.
[2024-06-01 08:33:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1156 ms
[2024-06-01 08:33:23] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 2 ms to minimize.
[2024-06-01 08:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2024-06-01 08:33:24] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-06-01 08:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2024-06-01 08:33:25] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 4 ms to minimize.
[2024-06-01 08:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 713 ms
[2024-06-01 08:33:26] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 3 ms to minimize.
[2024-06-01 08:33:27] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 2 ms to minimize.
[2024-06-01 08:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 810 ms
[2024-06-01 08:33:29] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 2 ms to minimize.
[2024-06-01 08:33:29] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 2 ms to minimize.
[2024-06-01 08:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 789 ms
[2024-06-01 08:33:30] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 3 ms to minimize.
[2024-06-01 08:33:31] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 2 ms to minimize.
[2024-06-01 08:33:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 826 ms
[2024-06-01 08:33:34] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 2 ms to minimize.
[2024-06-01 08:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-06-01 08:33:39] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 2 ms to minimize.
[2024-06-01 08:33:39] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:33:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
[2024-06-01 08:33:46] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:33:46] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 3 ms to minimize.
[2024-06-01 08:33:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 784 ms
[2024-06-01 08:33:47] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 2 ms to minimize.
[2024-06-01 08:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2024-06-01 08:33:48] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 3 ms to minimize.
[2024-06-01 08:33:48] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 2 ms to minimize.
[2024-06-01 08:33:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 810 ms
[2024-06-01 08:33:49] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 2 ms to minimize.
[2024-06-01 08:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2024-06-01 08:33:50] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 2 ms to minimize.
[2024-06-01 08:33:50] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-06-01 08:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 601 ms
TRAPS : Iteration 1
[2024-06-01 08:33:52] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 4 ms to minimize.
[2024-06-01 08:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 586 ms
[2024-06-01 08:33:52] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-06-01 08:33:53] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 3 ms to minimize.
[2024-06-01 08:33:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 827 ms
[2024-06-01 08:33:55] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-06-01 08:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 450 ms
[2024-06-01 08:33:56] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 4 ms to minimize.
[2024-06-01 08:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2024-06-01 08:33:59] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 3 ms to minimize.
[2024-06-01 08:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2024-06-01 08:34:00] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 2 ms to minimize.
[2024-06-01 08:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 425 ms
[2024-06-01 08:34:06] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-06-01 08:34:12] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:34:12] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 2 ms to minimize.
[2024-06-01 08:34:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 604 ms
[2024-06-01 08:34:17] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
TRAPS : Iteration 2
[2024-06-01 08:34:26] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2024-06-01 08:34:37] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
TRAPS : Iteration 3
[2024-06-01 08:34:54] [INFO ] Deduced a trap composed of 104 places in 906 ms of which 9 ms to minimize.
[2024-06-01 08:34:55] [INFO ] Deduced a trap composed of 82 places in 862 ms of which 5 ms to minimize.
[2024-06-01 08:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2018 ms
[2024-06-01 08:34:56] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 2 ms to minimize.
[2024-06-01 08:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2024-06-01 08:35:10] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
TRAPS : Iteration 4
[2024-06-01 08:35:43] [INFO ] After 197650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :205 real:1
[2024-06-01 08:35:43] [INFO ] After 200042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :205 real:1
RANDOM walk for 460987 steps (0 resets) in 120004 ms. (3 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 170 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 176 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 201 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 177 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 200 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 168 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 215 ms. (18 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 175 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 206 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 216 ms. (18 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 207 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 219 ms. (18 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 197 ms. (20 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 182 ms. (21 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 257 ms. (15 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 187 ms. (21 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 204 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 184 ms. (21 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 224 ms. (17 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 191 ms. (20 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 222 ms. (17 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 173 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 146 ms. (27 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 200 ms. (19 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 218 ms. (18 steps per ms) remains 3411/3411 properties
BEST_FIRST walk for 4004 steps (8 resets) in 204 ms. (19 steps per ms) remains 3411/3411 properties
Interrupted probabilistic random walk after 469557 steps, run timeout after 96002 ms. (steps per millisecond=4 ) properties seen :0 out of 3411
Probabilistic random walk after 469557 steps, saw 356628 distinct states, run finished after 96004 ms. (steps per millisecond=4 ) properties seen :0
[2024-06-01 08:37:52] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:37:52] [INFO ] Invariant cache hit.
[2024-06-01 08:37:52] [INFO ] State equation strengthened by 1246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 431/2600 variables, and 432 constraints, problems are : Problem set: 0 solved, 3411 unsolved in 90087 ms.
Refiners :[Domain max(s): 431/680 constraints, Positive P Invariants (semi-flows): 1/21 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/680 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 3411/3411 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 431/431 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 3 (OVERLAPS) 249/680 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 249/701 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/680 variables, 10/711 constraints. Problems are: Problem set: 0 solved, 3411 unsolved
[2024-06-01 08:40:35] [INFO ] Deduced a trap composed of 235 places in 829 ms of which 7 ms to minimize.
[2024-06-01 08:40:35] [INFO ] Deduced a trap composed of 11 places in 817 ms of which 6 ms to minimize.
[2024-06-01 08:40:36] [INFO ] Deduced a trap composed of 35 places in 654 ms of which 6 ms to minimize.
[2024-06-01 08:40:37] [INFO ] Deduced a trap composed of 27 places in 665 ms of which 5 ms to minimize.
[2024-06-01 08:40:38] [INFO ] Deduced a trap composed of 33 places in 824 ms of which 5 ms to minimize.
[2024-06-01 08:40:38] [INFO ] Deduced a trap composed of 25 places in 646 ms of which 5 ms to minimize.
[2024-06-01 08:40:39] [INFO ] Deduced a trap composed of 43 places in 732 ms of which 4 ms to minimize.
[2024-06-01 08:40:40] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 4 ms to minimize.
[2024-06-01 08:40:40] [INFO ] Deduced a trap composed of 29 places in 672 ms of which 7 ms to minimize.
[2024-06-01 08:40:41] [INFO ] Deduced a trap composed of 37 places in 704 ms of which 6 ms to minimize.
[2024-06-01 08:40:42] [INFO ] Deduced a trap composed of 35 places in 613 ms of which 6 ms to minimize.
[2024-06-01 08:40:42] [INFO ] Deduced a trap composed of 46 places in 619 ms of which 6 ms to minimize.
[2024-06-01 08:40:43] [INFO ] Deduced a trap composed of 27 places in 640 ms of which 6 ms to minimize.
[2024-06-01 08:40:44] [INFO ] Deduced a trap composed of 25 places in 643 ms of which 6 ms to minimize.
[2024-06-01 08:40:44] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 6 ms to minimize.
[2024-06-01 08:40:45] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 4 ms to minimize.
[2024-06-01 08:40:45] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 4 ms to minimize.
[2024-06-01 08:40:46] [INFO ] Deduced a trap composed of 23 places in 540 ms of which 5 ms to minimize.
[2024-06-01 08:40:46] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2600 variables, and 730 constraints, problems are : Problem set: 0 solved, 3411 unsolved in 90097 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/680 constraints, ReadFeed: 0/1246 constraints, PredecessorRefiner: 0/3411 constraints, Known Traps: 19/19 constraints]
After SMT, in 183752ms problems are : Problem set: 0 solved, 3411 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 431 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 396 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 680/680 places, 4790/4790 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 398 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
[2024-06-01 08:40:56] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:40:56] [INFO ] Invariant cache hit.
[2024-06-01 08:40:57] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 08:40:57] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:40:57] [INFO ] Invariant cache hit.
[2024-06-01 08:40:58] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-06-01 08:41:01] [INFO ] Implicit Places using invariants and state equation in 4109 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
[2024-06-01 08:41:01] [INFO ] Redundant transitions in 697 ms returned []
Running 4780 sub problems to find dead transitions.
[2024-06-01 08:41:02] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:41:02] [INFO ] Invariant cache hit.
[2024-06-01 08:41:02] [INFO ] State equation strengthened by 1246 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 680/680 constraints. Problems are: Problem set: 0 solved, 4780 unsolved
SMT process timed out in 35428ms, After SMT, problems are : Problem set: 0 solved, 4780 unsolved
Search for dead transitions found 0 dead transitions in 35481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41151 ms. Remains : 680/680 places, 4790/4790 transitions.
RANDOM walk for 400000 steps (8 resets) in 8361 ms. (47 steps per ms) remains 206/431 properties
Running SMT prover for 206 properties.
[2024-06-01 08:41:39] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:41:39] [INFO ] Invariant cache hit.
[2024-06-01 08:41:40] [INFO ] [Real]Absence check using 21 positive place invariants in 34 ms returned sat
[2024-06-01 08:41:40] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2024-06-01 08:41:41] [INFO ] After 1327ms SMT Verify possible using state equation in real domain returned unsat :0 sat :206
[2024-06-01 08:41:41] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2024-06-01 08:41:45] [INFO ] After 3429ms SMT Verify possible using 1246 Read/Feed constraints in real domain returned unsat :0 sat :206
TRAPS : Iteration 0
[2024-06-01 08:42:17] [INFO ] After 35758ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:206
[2024-06-01 08:42:17] [INFO ] After 37773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:206
[2024-06-01 08:42:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 24 ms returned sat
[2024-06-01 08:42:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2024-06-01 08:42:19] [INFO ] After 1275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :206
[2024-06-01 08:42:24] [INFO ] After 5422ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :206
TRAPS : Iteration 0
[2024-06-01 08:42:25] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 4 ms to minimize.
[2024-06-01 08:42:25] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 3 ms to minimize.
[2024-06-01 08:42:25] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 2 ms to minimize.
[2024-06-01 08:42:26] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:42:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1394 ms
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 22 places in 760 ms of which 7 ms to minimize.
[2024-06-01 08:42:27] [INFO ] Deduced a trap composed of 28 places in 766 ms of which 6 ms to minimize.
[2024-06-01 08:42:28] [INFO ] Deduced a trap composed of 24 places in 464 ms of which 5 ms to minimize.
[2024-06-01 08:42:29] [INFO ] Deduced a trap composed of 18 places in 601 ms of which 5 ms to minimize.
[2024-06-01 08:42:29] [INFO ] Deduced a trap composed of 35 places in 598 ms of which 7 ms to minimize.
[2024-06-01 08:42:30] [INFO ] Deduced a trap composed of 11 places in 677 ms of which 5 ms to minimize.
[2024-06-01 08:42:31] [INFO ] Deduced a trap composed of 3 places in 542 ms of which 7 ms to minimize.
[2024-06-01 08:42:31] [INFO ] Deduced a trap composed of 23 places in 616 ms of which 6 ms to minimize.
[2024-06-01 08:42:32] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 3 ms to minimize.
[2024-06-01 08:42:32] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 3 ms to minimize.
[2024-06-01 08:42:33] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 3 ms to minimize.
[2024-06-01 08:42:33] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2024-06-01 08:42:33] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2024-06-01 08:42:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7557 ms
[2024-06-01 08:42:34] [INFO ] Deduced a trap composed of 3 places in 461 ms of which 5 ms to minimize.
[2024-06-01 08:42:34] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 4 ms to minimize.
[2024-06-01 08:42:35] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:42:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1300 ms
[2024-06-01 08:42:35] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 4 ms to minimize.
[2024-06-01 08:42:36] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 2 ms to minimize.
[2024-06-01 08:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 824 ms
[2024-06-01 08:42:36] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-06-01 08:42:37] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2024-06-01 08:42:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 543 ms
[2024-06-01 08:42:37] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:42:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 08:42:38] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 2 ms to minimize.
[2024-06-01 08:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-06-01 08:42:38] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:42:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-01 08:42:39] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:42:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2024-06-01 08:42:40] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2024-06-01 08:42:42] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-06-01 08:42:43] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-06-01 08:42:43] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 08:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2024-06-01 08:42:45] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 2 ms to minimize.
[2024-06-01 08:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2024-06-01 08:42:48] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 2 ms to minimize.
[2024-06-01 08:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2024-06-01 08:42:48] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-06-01 08:42:50] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-06-01 08:42:51] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 2 ms to minimize.
[2024-06-01 08:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2024-06-01 08:42:52] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 2 ms to minimize.
[2024-06-01 08:42:52] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-01 08:42:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2024-06-01 08:42:53] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-06-01 08:42:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-01 08:42:55] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 2 ms to minimize.
[2024-06-01 08:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2024-06-01 08:42:56] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 2 ms to minimize.
[2024-06-01 08:42:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2024-06-01 08:42:58] [INFO ] Deduced a trap composed of 200 places in 976 ms of which 9 ms to minimize.
[2024-06-01 08:42:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1169 ms
[2024-06-01 08:43:00] [INFO ] Deduced a trap composed of 33 places in 747 ms of which 9 ms to minimize.
[2024-06-01 08:43:01] [INFO ] Deduced a trap composed of 138 places in 871 ms of which 8 ms to minimize.
[2024-06-01 08:43:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1922 ms
[2024-06-01 08:43:03] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 2 ms to minimize.
[2024-06-01 08:43:03] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2024-06-01 08:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2024-06-01 08:43:07] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2024-06-01 08:43:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-06-01 08:43:08] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2024-06-01 08:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-06-01 08:43:13] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 3 ms to minimize.
[2024-06-01 08:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-06-01 08:43:15] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 1 ms to minimize.
[2024-06-01 08:43:15] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-06-01 08:43:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
TRAPS : Iteration 1
[2024-06-01 08:43:17] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-06-01 08:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2024-06-01 08:43:18] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-01 08:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2024-06-01 08:43:19] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 3 ms to minimize.
[2024-06-01 08:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2024-06-01 08:43:20] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2024-06-01 08:43:23] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 3 ms to minimize.
[2024-06-01 08:43:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-06-01 08:43:23] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 4 ms to minimize.
[2024-06-01 08:43:24] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 3 ms to minimize.
[2024-06-01 08:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1002 ms
[2024-06-01 08:43:25] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2024-06-01 08:43:26] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 4 ms to minimize.
[2024-06-01 08:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2024-06-01 08:43:29] [INFO ] Deduced a trap composed of 110 places in 272 ms of which 4 ms to minimize.
[2024-06-01 08:43:29] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:43:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 868 ms
[2024-06-01 08:43:32] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 3 ms to minimize.
[2024-06-01 08:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 605 ms
[2024-06-01 08:43:32] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-06-01 08:43:33] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2024-06-01 08:43:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 797 ms
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 2 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 471 ms
[2024-06-01 08:43:54] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:43:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2024-06-01 08:44:01] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-06-01 08:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
TRAPS : Iteration 2
[2024-06-01 08:44:03] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 3 ms to minimize.
[2024-06-01 08:44:03] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2024-06-01 08:44:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 776 ms
[2024-06-01 08:44:04] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-06-01 08:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
TRAPS : Iteration 3
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
TRAPS : Iteration 4
[2024-06-01 08:45:37] [INFO ] After 198192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :206
[2024-06-01 08:45:37] [INFO ] After 200025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :206
RANDOM walk for 720 steps (0 resets) in 10 ms. (65 steps per ms) remains 0/1 properties
RANDOM walk for 58 steps (0 resets) in 15 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 21 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 683 steps (0 resets) in 19 ms. (34 steps per ms) remains 0/1 properties
RANDOM walk for 1034 steps (0 resets) in 24 ms. (41 steps per ms) remains 0/1 properties
RANDOM walk for 1892 steps (0 resets) in 25 ms. (72 steps per ms) remains 0/1 properties
RANDOM walk for 2780 steps (0 resets) in 21 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 3690 steps (0 resets) in 25 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 4035 steps (0 resets) in 26 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 5081 steps (0 resets) in 37 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 5483 steps (0 resets) in 35 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 6162 steps (0 resets) in 41 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 1623 steps (0 resets) in 16 ms. (95 steps per ms) remains 0/1 properties
RANDOM walk for 2427 steps (0 resets) in 20 ms. (115 steps per ms) remains 0/1 properties
RANDOM walk for 1555 steps (0 resets) in 14 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 3032 steps (0 resets) in 24 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 3865 steps (0 resets) in 30 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 4205 steps (0 resets) in 29 ms. (140 steps per ms) remains 0/1 properties
RANDOM walk for 5062 steps (0 resets) in 276 ms. (18 steps per ms) remains 0/1 properties
RANDOM walk for 6192 steps (0 resets) in 44 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 6634 steps (0 resets) in 43 ms. (150 steps per ms) remains 0/1 properties
RANDOM walk for 122 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 1594 steps (0 resets) in 16 ms. (93 steps per ms) remains 0/1 properties
RANDOM walk for 2177 steps (0 resets) in 17 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 2565 steps (0 resets) in 20 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 3891 steps (0 resets) in 27 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 4200 steps (0 resets) in 31 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 5166 steps (0 resets) in 37 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 6115 steps (0 resets) in 41 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 6861 steps (0 resets) in 45 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 181 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 707 steps (0 resets) in 9 ms. (70 steps per ms) remains 0/1 properties
RANDOM walk for 2360 steps (0 resets) in 20 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 2875 steps (0 resets) in 25 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 4205 steps (0 resets) in 30 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 4660 steps (0 resets) in 31 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 4990 steps (0 resets) in 34 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 5829 steps (0 resets) in 40 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 6175 steps (0 resets) in 42 ms. (143 steps per ms) remains 0/1 properties
RANDOM walk for 147 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 785 steps (0 resets) in 11 ms. (65 steps per ms) remains 0/1 properties
RANDOM walk for 1586 steps (0 resets) in 13 ms. (113 steps per ms) remains 0/1 properties
RANDOM walk for 3147 steps (0 resets) in 25 ms. (121 steps per ms) remains 0/1 properties
RANDOM walk for 3614 steps (0 resets) in 26 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 4092 steps (0 resets) in 32 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 4945 steps (0 resets) in 36 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 5835 steps (0 resets) in 40 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 6025 steps (0 resets) in 41 ms. (143 steps per ms) remains 0/1 properties
RANDOM walk for 150 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 730 steps (0 resets) in 10 ms. (66 steps per ms) remains 0/1 properties
RANDOM walk for 1429 steps (0 resets) in 9 ms. (142 steps per ms) remains 0/1 properties
RANDOM walk for 2095 steps (0 resets) in 15 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 3524 steps (0 resets) in 18 ms. (185 steps per ms) remains 0/1 properties
RANDOM walk for 4055 steps (0 resets) in 21 ms. (184 steps per ms) remains 0/1 properties
RANDOM walk for 4757 steps (0 resets) in 29 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 5116 steps (0 resets) in 26 ms. (189 steps per ms) remains 0/1 properties
RANDOM walk for 6458 steps (0 resets) in 33 ms. (189 steps per ms) remains 0/1 properties
RANDOM walk for 171 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/1 properties
RANDOM walk for 657 steps (0 resets) in 10 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 1308 steps (0 resets) in 10 ms. (118 steps per ms) remains 0/1 properties
RANDOM walk for 2168 steps (0 resets) in 13 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 2906 steps (0 resets) in 18 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 4967 steps (0 resets) in 25 ms. (191 steps per ms) remains 0/1 properties
RANDOM walk for 5054 steps (0 resets) in 27 ms. (180 steps per ms) remains 0/1 properties
RANDOM walk for 5886 steps (0 resets) in 154 ms. (37 steps per ms) remains 0/1 properties
RANDOM walk for 6769 steps (0 resets) in 33 ms. (199 steps per ms) remains 0/1 properties
RANDOM walk for 161 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/1 properties
RANDOM walk for 524 steps (0 resets) in 7 ms. (65 steps per ms) remains 0/1 properties
RANDOM walk for 1473 steps (0 resets) in 11 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 2182 steps (0 resets) in 14 ms. (145 steps per ms) remains 0/1 properties
RANDOM walk for 2530 steps (0 resets) in 14 ms. (168 steps per ms) remains 0/1 properties
RANDOM walk for 3731 steps (0 resets) in 23 ms. (155 steps per ms) remains 0/1 properties
RANDOM walk for 4704 steps (0 resets) in 30 ms. (151 steps per ms) remains 0/1 properties
RANDOM walk for 5653 steps (0 resets) in 31 ms. (176 steps per ms) remains 0/1 properties
RANDOM walk for 6170 steps (0 resets) in 32 ms. (186 steps per ms) remains 0/1 properties
RANDOM walk for 181 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/1 properties
RANDOM walk for 935 steps (0 resets) in 8 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 1516 steps (0 resets) in 10 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 2608 steps (0 resets) in 19 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 2618 steps (0 resets) in 18 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 3928 steps (0 resets) in 24 ms. (157 steps per ms) remains 0/1 properties
RANDOM walk for 4736 steps (0 resets) in 23 ms. (197 steps per ms) remains 0/1 properties
RANDOM walk for 5667 steps (0 resets) in 27 ms. (202 steps per ms) remains 0/1 properties
RANDOM walk for 6652 steps (0 resets) in 32 ms. (201 steps per ms) remains 0/1 properties
RANDOM walk for 116 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
RANDOM walk for 723 steps (0 resets) in 6 ms. (103 steps per ms) remains 0/1 properties
RANDOM walk for 1414 steps (0 resets) in 12 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 2224 steps (0 resets) in 13 ms. (158 steps per ms) remains 0/1 properties
RANDOM walk for 3073 steps (0 resets) in 17 ms. (170 steps per ms) remains 0/1 properties
RANDOM walk for 3366 steps (0 resets) in 19 ms. (168 steps per ms) remains 0/1 properties
RANDOM walk for 4602 steps (0 resets) in 24 ms. (184 steps per ms) remains 0/1 properties
RANDOM walk for 4937 steps (0 resets) in 26 ms. (182 steps per ms) remains 0/1 properties
RANDOM walk for 6478 steps (0 resets) in 34 ms. (185 steps per ms) remains 0/1 properties
RANDOM walk for 184 steps (0 resets) in 8 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 784 steps (0 resets) in 8 ms. (87 steps per ms) remains 0/1 properties
RANDOM walk for 1379 steps (0 resets) in 10 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 2160 steps (0 resets) in 13 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 2810 steps (0 resets) in 18 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 3542 steps (0 resets) in 21 ms. (161 steps per ms) remains 0/1 properties
RANDOM walk for 4187 steps (0 resets) in 23 ms. (174 steps per ms) remains 0/1 properties
RANDOM walk for 5150 steps (0 resets) in 26 ms. (190 steps per ms) remains 0/1 properties
RANDOM walk for 5491 steps (0 resets) in 27 ms. (196 steps per ms) remains 0/1 properties
RANDOM walk for 96 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 26815 steps (6 resets) in 116 ms. (229 steps per ms) remains 0/1 properties
RANDOM walk for 815 steps (0 resets) in 9 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 44 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 1517 steps (0 resets) in 13 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 2105 steps (0 resets) in 13 ms. (150 steps per ms) remains 0/1 properties
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 2633 steps (0 resets) in 18 ms. (138 steps per ms) remains 0/1 properties
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 15 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 3727 steps (0 resets) in 24 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 77 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 4169 steps (0 resets) in 25 ms. (160 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 4701 steps (0 resets) in 24 ms. (188 steps per ms) remains 0/1 properties
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 6043 steps (0 resets) in 30 ms. (194 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 91 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 6357 steps (0 resets) in 32 ms. (192 steps per ms) remains 0/1 properties
RANDOM walk for 43 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239085 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239085 steps, saw 186323 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 08:45:43] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:45:43] [INFO ] Invariant cache hit.
[2024-06-01 08:45:43] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1249 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:45:45] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:45:46] [INFO ] Deduced a trap composed of 3 places in 863 ms of which 6 ms to minimize.
[2024-06-01 08:45:47] [INFO ] Deduced a trap composed of 85 places in 697 ms of which 6 ms to minimize.
[2024-06-01 08:45:48] [INFO ] Deduced a trap composed of 3 places in 926 ms of which 7 ms to minimize.
[2024-06-01 08:45:48] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 2 ms to minimize.
[2024-06-01 08:45:48] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 2 ms to minimize.
[2024-06-01 08:45:48] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 6/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1117/2645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 0/2645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2600 variables, 0/2645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2645 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4965 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 6250ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 45 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 14 ms.
RANDOM walk for 87 steps (0 resets) in 11 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 762 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247962 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247962 steps, saw 192860 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-06-01 08:45:53] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:45:53] [INFO ] Invariant cache hit.
[2024-06-01 08:45:53] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1125 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:45:54] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:45:55] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 4 ms to minimize.
[2024-06-01 08:45:56] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 5 ms to minimize.
[2024-06-01 08:45:56] [INFO ] Deduced a trap composed of 37 places in 441 ms of which 4 ms to minimize.
[2024-06-01 08:45:56] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1117/2643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 0/2643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2600 variables, 0/2643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2643 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3318 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4479ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 249799 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 249799 steps, saw 194216 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 08:46:00] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:46:00] [INFO ] Invariant cache hit.
[2024-06-01 08:46:00] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1183 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:02] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:03] [INFO ] Deduced a trap composed of 6 places in 510 ms of which 5 ms to minimize.
[2024-06-01 08:46:03] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 4 ms to minimize.
[2024-06-01 08:46:04] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 4 ms to minimize.
[2024-06-01 08:46:04] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 4/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1117/2643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:05] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 3 ms to minimize.
[2024-06-01 08:46:06] [INFO ] Deduced a trap composed of 3 places in 462 ms of which 5 ms to minimize.
[2024-06-01 08:46:06] [INFO ] Deduced a trap composed of 3 places in 327 ms of which 3 ms to minimize.
[2024-06-01 08:46:06] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 4/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2600 variables, 0/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2600 variables, 0/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4969 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8080 steps, including 328 resets, run visited all 1 properties in 55 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 55 ms.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 237523 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 237523 steps, saw 185099 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 08:46:10] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:46:10] [INFO ] Invariant cache hit.
[2024-06-01 08:46:10] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1262 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:11] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:12] [INFO ] Deduced a trap composed of 3 places in 426 ms of which 4 ms to minimize.
[2024-06-01 08:46:12] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 3 ms to minimize.
[2024-06-01 08:46:13] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 3/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1117/2642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:14] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:46:14] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 2/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2809 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 4109ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 67 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232716 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232716 steps, saw 181340 distinct states, run finished after 3004 ms. (steps per millisecond=77 ) properties seen :0
[2024-06-01 08:46:17] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:46:17] [INFO ] Invariant cache hit.
[2024-06-01 08:46:17] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1214 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:18] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:19] [INFO ] Deduced a trap composed of 25 places in 553 ms of which 4 ms to minimize.
[2024-06-01 08:46:20] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 3 ms to minimize.
[2024-06-01 08:46:20] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 3 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 3 places in 502 ms of which 5 ms to minimize.
[2024-06-01 08:46:21] [INFO ] Deduced a trap composed of 23 places in 369 ms of which 4 ms to minimize.
[2024-06-01 08:46:22] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 5 ms to minimize.
[2024-06-01 08:46:22] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 4 ms to minimize.
[2024-06-01 08:46:22] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 8/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5014 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6264ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 303 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 279983 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 279983 steps, saw 190019 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 08:46:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:46:27] [INFO ] Computed 31 invariants in 10 ms
[2024-06-01 08:46:27] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:28] [INFO ] Deduced a trap composed of 3 places in 360 ms of which 3 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:46:29] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1063 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2924ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7614 steps, including 390 resets, run visited all 1 properties in 65 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 66 ms.
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250019 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250019 steps, saw 194383 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2024-06-01 08:46:33] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:46:33] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 08:46:33] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:34] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:35] [INFO ] Deduced a trap composed of 3 places in 634 ms of which 5 ms to minimize.
[2024-06-01 08:46:36] [INFO ] Deduced a trap composed of 3 places in 792 ms of which 7 ms to minimize.
[2024-06-01 08:46:37] [INFO ] Deduced a trap composed of 21 places in 691 ms of which 6 ms to minimize.
[2024-06-01 08:46:37] [INFO ] Deduced a trap composed of 24 places in 565 ms of which 3 ms to minimize.
[2024-06-01 08:46:38] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 3 ms to minimize.
[2024-06-01 08:46:38] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 2 ms to minimize.
[2024-06-01 08:46:38] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 7/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1117/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 0/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2600 variables, 0/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4958 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6240ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 196 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280885 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280885 steps, saw 190672 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 08:46:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:46:42] [INFO ] Computed 31 invariants in 6 ms
[2024-06-01 08:46:42] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:44] [INFO ] Deduced a trap composed of 45 places in 590 ms of which 5 ms to minimize.
[2024-06-01 08:46:45] [INFO ] Deduced a trap composed of 45 places in 540 ms of which 5 ms to minimize.
[2024-06-01 08:46:46] [INFO ] Deduced a trap composed of 3 places in 746 ms of which 4 ms to minimize.
[2024-06-01 08:46:46] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 2 ms to minimize.
[2024-06-01 08:46:46] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:46:46] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 3 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 3 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 3 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 59 places in 223 ms of which 2 ms to minimize.
[2024-06-01 08:46:47] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 4 ms to minimize.
[2024-06-01 08:46:48] [INFO ] Deduced a trap composed of 15 places in 351 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1070 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5481 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 6415ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 49 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234135 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234135 steps, saw 182466 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 08:46:52] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:46:52] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 08:46:52] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1230 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:53] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:46:55] [INFO ] Deduced a trap composed of 3 places in 1123 ms of which 9 ms to minimize.
[2024-06-01 08:46:56] [INFO ] Deduced a trap composed of 3 places in 749 ms of which 5 ms to minimize.
[2024-06-01 08:46:56] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 4 ms to minimize.
[2024-06-01 08:46:57] [INFO ] Deduced a trap composed of 37 places in 412 ms of which 5 ms to minimize.
[2024-06-01 08:46:57] [INFO ] Deduced a trap composed of 44 places in 614 ms of which 6 ms to minimize.
[2024-06-01 08:46:58] [INFO ] Deduced a trap composed of 19 places in 550 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 6/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6283ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 191 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 269632 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 269632 steps, saw 183383 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-06-01 08:47:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:47:01] [INFO ] Computed 31 invariants in 7 ms
[2024-06-01 08:47:01] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 388/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 36/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:47:03] [INFO ] Deduced a trap composed of 3 places in 535 ms of which 6 ms to minimize.
[2024-06-01 08:47:04] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 3 ms to minimize.
[2024-06-01 08:47:04] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 4 ms to minimize.
[2024-06-01 08:47:04] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 3 ms to minimize.
[2024-06-01 08:47:04] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:47:05] [INFO ] Deduced a trap composed of 20 places in 292 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 388/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1064 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2911 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 156 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 155 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:47:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:47:06] [INFO ] Invariant cache hit.
[2024-06-01 08:47:07] [INFO ] Implicit Places using invariants in 1480 ms returned []
[2024-06-01 08:47:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:47:07] [INFO ] Invariant cache hit.
[2024-06-01 08:47:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:47:15] [INFO ] Implicit Places using invariants and state equation in 7722 ms returned []
Implicit Place search using SMT with State Equation took 9205 ms to find 0 implicit places.
[2024-06-01 08:47:15] [INFO ] Redundant transitions in 314 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:47:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:47:15] [INFO ] Invariant cache hit.
[2024-06-01 08:47:15] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33583ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43359 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 9 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 96 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 08:47:49] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 08:47:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:47:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 08:47:49] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:47:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 08:47:49] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:47:49] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:47:49] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232364 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232364 steps, saw 181070 distinct states, run finished after 3003 ms. (steps per millisecond=77 ) properties seen :0
[2024-06-01 08:47:52] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:47:52] [INFO ] Computed 31 invariants in 10 ms
[2024-06-01 08:47:52] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 91/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 36/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1117/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1068 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:47:53] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 36/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:47:55] [INFO ] Deduced a trap composed of 38 places in 908 ms of which 7 ms to minimize.
[2024-06-01 08:47:56] [INFO ] Deduced a trap composed of 25 places in 904 ms of which 7 ms to minimize.
[2024-06-01 08:47:57] [INFO ] Deduced a trap composed of 24 places in 896 ms of which 7 ms to minimize.
[2024-06-01 08:47:58] [INFO ] Deduced a trap composed of 25 places in 1052 ms of which 6 ms to minimize.
[2024-06-01 08:47:59] [INFO ] Deduced a trap composed of 7 places in 908 ms of which 6 ms to minimize.
SMT process timed out in 6456ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 231 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 256188 steps, run visited all 1 properties in 2755 ms. (steps per millisecond=92 )
Probabilistic random walk after 256188 steps, saw 174954 distinct states, run finished after 2765 ms. (steps per millisecond=92 ) properties seen :1
RANDOM walk for 24 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 25699 steps (5 resets) in 117 ms. (217 steps per ms) remains 0/1 properties
RANDOM walk for 54 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 33432 steps (7 resets) in 141 ms. (235 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 243694 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 243694 steps, saw 189732 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-06-01 08:48:05] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:48:05] [INFO ] Invariant cache hit.
[2024-06-01 08:48:05] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1074 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:06] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:07] [INFO ] Deduced a trap composed of 22 places in 570 ms of which 5 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 3 places in 497 ms of which 4 ms to minimize.
[2024-06-01 08:48:08] [INFO ] Deduced a trap composed of 37 places in 412 ms of which 3 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 3 ms to minimize.
[2024-06-01 08:48:09] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 5/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1118/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3779 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 4889ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24652 steps, including 434 resets, run visited all 1 properties in 131 ms. (steps per millisecond=188 )
Parikh walk visited 1 properties in 131 ms.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242253 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242253 steps, saw 188658 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-06-01 08:48:13] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:48:13] [INFO ] Invariant cache hit.
[2024-06-01 08:48:13] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1320 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:15] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:16] [INFO ] Deduced a trap composed of 51 places in 672 ms of which 5 ms to minimize.
[2024-06-01 08:48:16] [INFO ] Deduced a trap composed of 9 places in 521 ms of which 4 ms to minimize.
[2024-06-01 08:48:17] [INFO ] Deduced a trap composed of 3 places in 553 ms of which 6 ms to minimize.
[2024-06-01 08:48:17] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 3 ms to minimize.
[2024-06-01 08:48:17] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 2 ms to minimize.
[2024-06-01 08:48:18] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2024-06-01 08:48:18] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 7/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1118/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:19] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 3 ms to minimize.
[2024-06-01 08:48:19] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 2/2648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2600 variables, 0/2648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2600 variables, 0/2648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2648 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4711 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 6067ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 213 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256608 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256608 steps, saw 175249 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 08:48:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:48:23] [INFO ] Computed 31 invariants in 6 ms
[2024-06-01 08:48:23] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:24] [INFO ] Deduced a trap composed of 129 places in 626 ms of which 5 ms to minimize.
[2024-06-01 08:48:25] [INFO ] Deduced a trap composed of 112 places in 651 ms of which 5 ms to minimize.
[2024-06-01 08:48:26] [INFO ] Deduced a trap composed of 139 places in 634 ms of which 5 ms to minimize.
[2024-06-01 08:48:26] [INFO ] Deduced a trap composed of 91 places in 733 ms of which 7 ms to minimize.
[2024-06-01 08:48:27] [INFO ] Deduced a trap composed of 17 places in 651 ms of which 5 ms to minimize.
[2024-06-01 08:48:28] [INFO ] Deduced a trap composed of 127 places in 557 ms of which 7 ms to minimize.
[2024-06-01 08:48:28] [INFO ] Deduced a trap composed of 134 places in 695 ms of which 5 ms to minimize.
[2024-06-01 08:48:29] [INFO ] Deduced a trap composed of 138 places in 817 ms of which 8 ms to minimize.
[2024-06-01 08:48:30] [INFO ] Deduced a trap composed of 113 places in 815 ms of which 8 ms to minimize.
[2024-06-01 08:48:31] [INFO ] Deduced a trap composed of 140 places in 818 ms of which 12 ms to minimize.
[2024-06-01 08:48:32] [INFO ] Deduced a trap composed of 152 places in 743 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 11/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:48:32] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1071 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9486 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 10127ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 199 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 170 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 167 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:48:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:48:33] [INFO ] Invariant cache hit.
[2024-06-01 08:48:34] [INFO ] Implicit Places using invariants in 1008 ms returned []
[2024-06-01 08:48:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:48:34] [INFO ] Invariant cache hit.
[2024-06-01 08:48:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:48:42] [INFO ] Implicit Places using invariants and state equation in 7390 ms returned []
Implicit Place search using SMT with State Equation took 8402 ms to find 0 implicit places.
[2024-06-01 08:48:42] [INFO ] Redundant transitions in 292 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:48:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:48:42] [INFO ] Invariant cache hit.
[2024-06-01 08:48:42] [INFO ] State equation strengthened by 436 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/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34165ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43112 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 54 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 08:49:16] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 08:49:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:49:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2024-06-01 08:49:16] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:49:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 08:49:16] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:49:16] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:49:16] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 260 ms.
RANDOM walk for 40000 steps (8 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239723 steps, run timeout after 3042 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 239723 steps, saw 186800 distinct states, run finished after 3042 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 08:49:20] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:49:20] [INFO ] Computed 31 invariants in 6 ms
[2024-06-01 08:49:20] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:21] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:22] [INFO ] Deduced a trap composed of 3 places in 720 ms of which 7 ms to minimize.
[2024-06-01 08:49:23] [INFO ] Deduced a trap composed of 5 places in 589 ms of which 5 ms to minimize.
[2024-06-01 08:49:23] [INFO ] Deduced a trap composed of 3 places in 549 ms of which 5 ms to minimize.
[2024-06-01 08:49:24] [INFO ] Deduced a trap composed of 69 places in 442 ms of which 4 ms to minimize.
[2024-06-01 08:49:24] [INFO ] Deduced a trap composed of 11 places in 457 ms of which 5 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 5/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1118/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2600 variables, 0/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4690 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5779ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 3 ms.
RANDOM walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234190 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234190 steps, saw 182510 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-06-01 08:49:29] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2024-06-01 08:49:29] [INFO ] Invariant cache hit.
[2024-06-01 08:49:29] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1468 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:30] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:32] [INFO ] Deduced a trap composed of 102 places in 844 ms of which 10 ms to minimize.
[2024-06-01 08:49:32] [INFO ] Deduced a trap composed of 3 places in 839 ms of which 5 ms to minimize.
[2024-06-01 08:49:33] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 4 ms to minimize.
[2024-06-01 08:49:33] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 3 ms to minimize.
[2024-06-01 08:49:33] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 5/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1118/2644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:35] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2024-06-01 08:49:35] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 2/2646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 6514ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 291 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 259633 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 259633 steps, saw 176751 distinct states, run finished after 3003 ms. (steps per millisecond=86 ) properties seen :0
[2024-06-01 08:49:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:49:38] [INFO ] Computed 31 invariants in 3 ms
[2024-06-01 08:49:38] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:39] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:40] [INFO ] Deduced a trap composed of 17 places in 537 ms of which 5 ms to minimize.
[2024-06-01 08:49:41] [INFO ] Deduced a trap composed of 21 places in 397 ms of which 3 ms to minimize.
[2024-06-01 08:49:41] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 2 ms to minimize.
[2024-06-01 08:49:41] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 2 ms to minimize.
[2024-06-01 08:49:41] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:42] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-06-01 08:49:42] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 3 ms to minimize.
[2024-06-01 08:49:42] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 3/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1067 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3445 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 4151ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1722 steps, including 35 resets, run visited all 1 properties in 9 ms. (steps per millisecond=191 )
Parikh walk visited 1 properties in 9 ms.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225313 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225313 steps, saw 175920 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 08:49:46] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:49:46] [INFO ] Computed 31 invariants in 5 ms
[2024-06-01 08:49:46] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1229 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:47] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 3 places in 622 ms of which 5 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 4 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 21 places in 589 ms of which 5 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 4 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 5 ms to minimize.
[2024-06-01 08:49:50] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1160 variables, 6/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1160 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1440/2600 variables, 495/1527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2600 variables, 1118/2645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:49:51] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2600 variables, 2/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2600 variables, 0/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2600 variables, 0/2647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2600/2600 variables, and 2647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4820 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 6091ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 160 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 310 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 270039 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 270039 steps, saw 183613 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2024-06-01 08:49:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:49:55] [INFO ] Computed 31 invariants in 4 ms
[2024-06-01 08:49:55] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:56] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/332 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 396/962 variables, 18/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/980 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:49:57] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 3 ms to minimize.
[2024-06-01 08:49:57] [INFO ] Deduced a trap composed of 31 places in 392 ms of which 3 ms to minimize.
[2024-06-01 08:49:58] [INFO ] Deduced a trap composed of 3 places in 525 ms of which 5 ms to minimize.
[2024-06-01 08:49:58] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 5 ms to minimize.
[2024-06-01 08:49:59] [INFO ] Deduced a trap composed of 59 places in 363 ms of which 5 ms to minimize.
[2024-06-01 08:49:59] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 4 ms to minimize.
[2024-06-01 08:49:59] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 4 ms to minimize.
[2024-06-01 08:50:00] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 630/1610 variables, 414/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 389/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:50:00] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 5273ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 179 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 165 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:50:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:50:01] [INFO ] Invariant cache hit.
[2024-06-01 08:50:02] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-06-01 08:50:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:50:02] [INFO ] Invariant cache hit.
[2024-06-01 08:50:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:50:09] [INFO ] Implicit Places using invariants and state equation in 6887 ms returned []
Implicit Place search using SMT with State Equation took 8148 ms to find 0 implicit places.
[2024-06-01 08:50:10] [INFO ] Redundant transitions in 294 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:50:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:50:10] [INFO ] Invariant cache hit.
[2024-06-01 08:50:10] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 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 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.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 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.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 0.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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 34219ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 34282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42908 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 71 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 08:50:44] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 08:50:44] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:50:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-06-01 08:50:44] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 08:50:44] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:50:44] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:50:44] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 367 ms.
RANDOM walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 226578 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 226578 steps, saw 176669 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-06-01 08:50:47] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2024-06-01 08:50:47] [INFO ] Computed 31 invariants in 4 ms
[2024-06-01 08:50:47] [INFO ] State equation strengthened by 1246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/259 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 172/431 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 93/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 234/665 variables, 108/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 108/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 33/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 477/1142 variables, 18/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1142 variables, 477/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/1160 variables, 9/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1160 variables, 18/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1440/2600 variables, 495/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2600 variables, 1118/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2600 variables, 0/2637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2600/2600 variables, and 2637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1573 ms.
Refiners :[Domain max(s): 680/680 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 680/680 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:50:49] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/259 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 172/431 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 93/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 234/665 variables, 108/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 108/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 33/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 477/1142 variables, 18/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1142 variables, 477/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1142 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 18/1160 variables, 9/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1160 variables, 18/1025 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1160 variables, 1/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:50:51] [INFO ] Deduced a trap composed of 5 places in 1094 ms of which 8 ms to minimize.
[2024-06-01 08:50:52] [INFO ] Deduced a trap composed of 21 places in 974 ms of which 8 ms to minimize.
[2024-06-01 08:50:52] [INFO ] Deduced a trap composed of 22 places in 596 ms of which 5 ms to minimize.
[2024-06-01 08:50:53] [INFO ] Deduced a trap composed of 48 places in 446 ms of which 5 ms to minimize.
[2024-06-01 08:50:53] [INFO ] Deduced a trap composed of 43 places in 462 ms of which 4 ms to minimize.
[2024-06-01 08:50:54] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 4 ms to minimize.
[2024-06-01 08:50:54] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 4 ms to minimize.
SMT process timed out in 6871ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 308 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 590/680 places, 3890/4790 transitions.
RANDOM walk for 40000 steps (8 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238656 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238656 steps, saw 164136 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 08:50:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2024-06-01 08:50:58] [INFO ] Computed 31 invariants in 2 ms
[2024-06-01 08:50:58] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/332 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 396/962 variables, 18/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:50:59] [INFO ] Deduced a trap composed of 3 places in 519 ms of which 4 ms to minimize.
[2024-06-01 08:51:00] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-06-01 08:51:00] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 2 ms to minimize.
[2024-06-01 08:51:00] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 3 ms to minimize.
[2024-06-01 08:51:01] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 3 ms to minimize.
[2024-06-01 08:51:01] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-06-01 08:51:01] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/980 variables, 7/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 630/1610 variables, 414/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 389/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1065 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3727ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 165 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 158 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2024-06-01 08:51:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:51:02] [INFO ] Invariant cache hit.
[2024-06-01 08:51:03] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2024-06-01 08:51:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:51:03] [INFO ] Invariant cache hit.
[2024-06-01 08:51:04] [INFO ] State equation strengthened by 436 read => feed constraints.
[2024-06-01 08:51:09] [INFO ] Implicit Places using invariants and state equation in 5934 ms returned []
Implicit Place search using SMT with State Equation took 7153 ms to find 0 implicit places.
[2024-06-01 08:51:09] [INFO ] Redundant transitions in 200 ms returned []
Running 3880 sub problems to find dead transitions.
[2024-06-01 08:51:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2024-06-01 08:51:09] [INFO ] Invariant cache hit.
[2024-06-01 08:51:09] [INFO ] State equation strengthened by 436 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/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 33650ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 33689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41213 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 50 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2024-06-01 08:51:43] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 08:51:43] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:51:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2024-06-01 08:51:43] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 08:51:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 08:51:43] [INFO ] After 10ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:51:43] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:51:43] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;