About the Execution of LTSMin+red for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4770.396 | 1800000.00 | 3257933.00 | 4670.00 | [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-171636275100119.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-08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r494-smll-171636275100119
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 1.7M 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 Liveness
=== Now, execution of the tool begins
BK_START 1717226688978
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:24:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:24:52] [INFO ] Load time of PNML (sax parser for PT used): 659 ms
[2024-06-01 07:24:52] [INFO ] Transformed 712 places.
[2024-06-01 07:24:52] [INFO ] Transformed 2816 transitions.
[2024-06-01 07:24:52] [INFO ] Found NUPN structural information;
[2024-06-01 07:24:52] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 946 ms.
Built sparse matrix representations for Structural reductions in 30 ms.26835KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 418 ms. Remains 712 /712 variables (removed 0) and now considering 2816/2816 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 453 ms. Remains : 712/712 places, 2816/2816 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 146 ms. Remains 712 /712 variables (removed 0) and now considering 2816/2816 (removed 0) transitions.
[2024-06-01 07:24:54] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2024-06-01 07:24:54] [INFO ] Computed 25 invariants in 40 ms
[2024-06-01 07:24:54] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-06-01 07:24:54] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-06-01 07:24:54] [INFO ] Invariant cache hit.
[2024-06-01 07:24:55] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-06-01 07:24:56] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
[2024-06-01 07:24:56] [INFO ] Redundant transitions in 287 ms returned []
Running 2808 sub problems to find dead transitions.
[2024-06-01 07:24:56] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-06-01 07:24:56] [INFO ] Invariant cache hit.
[2024-06-01 07:24:56] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 712/712 constraints. Problems are: Problem set: 0 solved, 2808 unsolved
SMT process timed out in 32776ms, After SMT, problems are : Problem set: 0 solved, 2808 unsolved
Search for dead transitions found 0 dead transitions in 32954ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 35615 ms. Remains : 712/712 places, 2816/2816 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4042 ms (no deadlock found). (steps per millisecond=309 )
Random directed walk for 1250007 steps, including 0 resets, run took 5937 ms (no deadlock found). (steps per millisecond=210 )
[2024-06-01 07:25:39] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2024-06-01 07:25:39] [INFO ] Invariant cache hit.
[2024-06-01 07:25:40] [INFO ] [Real]Absence check using 17 positive place invariants in 44 ms returned sat
[2024-06-01 07:25:40] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 138 ms returned sat
[2024-06-01 07:25:43] [INFO ] [Real]Absence check using state equation in 2348 ms returned sat
[2024-06-01 07:25:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:25:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2024-06-01 07:25:44] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 88 ms returned sat
[2024-06-01 07:25:46] [INFO ] [Nat]Absence check using state equation in 2174 ms returned sat
[2024-06-01 07:25:46] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-06-01 07:25:46] [INFO ] [Nat]Added 676 Read/Feed constraints in 293 ms returned sat
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 3 places in 1262 ms of which 118 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 3 places in 955 ms of which 12 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 88 places in 1086 ms of which 11 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 36 places in 999 ms of which 12 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 32 places in 1115 ms of which 11 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 58 places in 988 ms of which 10 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 1049 ms of which 11 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 1082 ms of which 11 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 900 ms of which 10 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 3 places in 903 ms of which 10 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 3 places in 986 ms of which 11 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 13166 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 704 transition count 2608
Deduced a syphon composed of 200 places in 9 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 504 transition count 2608
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 12 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 448 transition count 2552
Applied a total of 528 rules in 248 ms. Remains 448 /712 variables (removed 264) and now considering 2552/2816 (removed 264) transitions.
[2024-06-01 07:26:00] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
// Phase 1: matrix 1104 rows 448 cols
[2024-06-01 07:26:00] [INFO ] Computed 25 invariants in 12 ms
[2024-06-01 07:26:01] [INFO ] Implicit Places using invariants in 1344 ms returned []
[2024-06-01 07:26:01] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-06-01 07:26:01] [INFO ] Invariant cache hit.
[2024-06-01 07:26:02] [INFO ] State equation strengthened by 676 read => feed constraints.
[2024-06-01 07:26:06] [INFO ] Implicit Places using invariants and state equation in 4921 ms returned []
Implicit Place search using SMT with State Equation took 6267 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2024-06-01 07:26:06] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-06-01 07:26:06] [INFO ] Invariant cache hit.
[2024-06-01 07:26:06] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 448/448 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 32338ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 32377ms
Starting structural reductions in LIVENESS mode, iteration 1 : 448/712 places, 2552/2816 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 38902 ms. Remains : 448/712 places, 2552/2816 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 12871 ms. (3 steps per ms) remains 2098/2544 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2098/2098 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2098/2098 properties
[2024-06-01 07:26:42] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-06-01 07:26:42] [INFO ] Invariant cache hit.
[2024-06-01 07:26:42] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 343/343 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
SMT process timed out in 6673ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 343 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Applied a total of 0 rules in 113 ms. Remains 448 /448 variables (removed 0) and now considering 2552/2552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 448/448 places, 2552/2552 transitions.
RANDOM walk for 738774 steps (0 resets) in 120004 ms. (6 steps per ms) remains 2072/2098 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2072/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2071/2072 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2071/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2069/2071 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2069/2069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2067/2069 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2065/2067 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 2065/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2064/2065 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2063/2064 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 2063/2063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2061/2063 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 2060/2061 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 2060/2060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2059/2060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2059/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2058/2059 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2058/2058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 2057/2058 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 2057/2057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2056/2057 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2056/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2055/2056 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2055/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2053/2055 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2053/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2050/2053 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2050/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2048/2050 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2048/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2047/2048 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2047/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2045/2047 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2045/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2044/2045 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2044/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2043/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2042/2043 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2042/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2041/2042 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2041/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2040/2041 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2040/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2039/2040 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2039/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2038/2039 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2038/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2036/2038 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2036/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2035/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2035 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2034/2034 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2034/2034 properties
Probabilistic random walk after 1000001 steps, saw 657639 distinct states, run finished after 100634 ms. (steps per millisecond=9 ) properties seen :501
[2024-06-01 07:29:06] [INFO ] Flow matrix only has 1104 transitions (discarded 1448 similar events)
[2024-06-01 07:29:06] [INFO ] Invariant cache hit.
[2024-06-01 07:29:06] [INFO ] State equation strengthened by 676 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 3 (OVERLAPS) 216/448 variables, 16/249 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 216/465 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1552 variables, and 473 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 45047 ms.
Refiners :[Domain max(s): 448/448 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/448 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 1533/1533 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1533 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 3 (OVERLAPS) 216/448 variables, 16/249 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 216/465 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 67 places in 497 ms of which 5 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 27 places in 509 ms of which 6 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 39 places in 569 ms of which 5 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 36 places in 552 ms of which 4 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 55 places in 540 ms of which 5 ms to minimize.
[2024-06-01 07:30:17] [INFO ] Deduced a trap composed of 49 places in 544 ms of which 4 ms to minimize.
[2024-06-01 07:30:17] [INFO ] Deduced a trap composed of 42 places in 508 ms of which 5 ms to minimize.
[2024-06-01 07:30:18] [INFO ] Deduced a trap composed of 126 places in 544 ms of which 5 ms to minimize.
[2024-06-01 07:30:18] [INFO ] Deduced a trap composed of 30 places in 593 ms of which 7 ms to minimize.
[2024-06-01 07:30:19] [INFO ] Deduced a trap composed of 23 places in 620 ms of which 6 ms to minimize.
[2024-06-01 07:30:20] [INFO ] Deduced a trap composed of 3 places in 546 ms of which 5 ms to minimize.
[2024-06-01 07:30:20] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 5 ms to minimize.
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 31 places in 472 ms of which 4 ms to minimize.
[2024-06-01 07:30:21] [INFO ] Deduced a trap composed of 25 places in 479 ms of which 5 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 19 places in 491 ms of which 5 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:30:22] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 77 places in 565 ms of which 6 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 90 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:30:24] [INFO ] Deduced a trap composed of 86 places in 433 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 25 places in 573 ms of which 5 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 38 places in 642 ms of which 4 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 59 places in 553 ms of which 4 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 124 places in 515 ms of which 5 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 61 places in 469 ms of which 4 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 4 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 19 places in 493 ms of which 4 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 25 places in 486 ms of which 4 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 22 places in 497 ms of which 7 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 26 places in 576 ms of which 5 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 7 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 33 places in 710 ms of which 6 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 98 places in 489 ms of which 6 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 104 places in 604 ms of which 4 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 110 places in 449 ms of which 4 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 104 places in 454 ms of which 6 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 52 places in 573 ms of which 5 ms to minimize.
[2024-06-01 07:30:36] [INFO ] Deduced a trap composed of 25 places in 502 ms of which 4 ms to minimize.
[2024-06-01 07:30:36] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 4 ms to minimize.
[2024-06-01 07:30:37] [INFO ] Deduced a trap composed of 80 places in 431 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 20/513 constraints. Problems are: Problem set: 0 solved, 1533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/1552 variables, and 513 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 45045 ms.
Refiners :[Domain max(s): 448/448 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/448 constraints, ReadFeed: 0/676 constraints, PredecessorRefiner: 0/1533 constraints, Known Traps: 40/40 constraints]
After SMT, in 91301ms problems are : Problem set: 0 solved, 1533 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 232 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2552/2552 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 439 transition count 2480
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 439 transition count 2480
Applied a total of 18 rules in 156 ms. Remains 439 /448 variables (removed 9) and now considering 2480/2552 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 439/448 places, 2480/2552 transitions.
RANDOM walk for 995113 steps (0 resets) in 120004 ms. (8 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1533/1533 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1533/1533 properties
Interrupted probabilistic random walk after 996363 steps, run timeout after 93001 ms. (steps per millisecond=10 ) properties seen :25 out of 1533
Probabilistic random walk after 996363 steps, saw 634247 distinct states, run finished after 93012 ms. (steps per millisecond=10 ) properties seen :25
[2024-06-01 07:32:42] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-06-01 07:32:42] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 07:32:42] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 2 (OVERLAPS) 218/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 32 places in 691 ms of which 7 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 29 places in 610 ms of which 7 ms to minimize.
[2024-06-01 07:33:40] [INFO ] Deduced a trap composed of 30 places in 471 ms of which 4 ms to minimize.
[2024-06-01 07:33:40] [INFO ] Deduced a trap composed of 35 places in 599 ms of which 7 ms to minimize.
[2024-06-01 07:33:41] [INFO ] Deduced a trap composed of 23 places in 702 ms of which 7 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 25 places in 694 ms of which 7 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:33:43] [INFO ] Deduced a trap composed of 96 places in 609 ms of which 6 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 99 places in 649 ms of which 6 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 97 places in 728 ms of which 6 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 83 places in 666 ms of which 6 ms to minimize.
[2024-06-01 07:33:46] [INFO ] Deduced a trap composed of 84 places in 655 ms of which 6 ms to minimize.
[2024-06-01 07:33:47] [INFO ] Deduced a trap composed of 85 places in 679 ms of which 7 ms to minimize.
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 103 places in 573 ms of which 6 ms to minimize.
[2024-06-01 07:33:49] [INFO ] Deduced a trap composed of 86 places in 573 ms of which 6 ms to minimize.
[2024-06-01 07:33:49] [INFO ] Deduced a trap composed of 104 places in 535 ms of which 6 ms to minimize.
[2024-06-01 07:33:49] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:33:50] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:33:50] [INFO ] Deduced a trap composed of 132 places in 615 ms of which 6 ms to minimize.
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 119 places in 618 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1508 unsolved
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 3 places in 822 ms of which 6 ms to minimize.
[2024-06-01 07:33:54] [INFO ] Deduced a trap composed of 28 places in 747 ms of which 7 ms to minimize.
[2024-06-01 07:33:55] [INFO ] Deduced a trap composed of 18 places in 753 ms of which 7 ms to minimize.
[2024-06-01 07:33:56] [INFO ] Deduced a trap composed of 36 places in 695 ms of which 7 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 3 places in 708 ms of which 6 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 51 places in 338 ms of which 4 ms to minimize.
[2024-06-01 07:33:57] [INFO ] Deduced a trap composed of 46 places in 338 ms of which 3 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 3 ms to minimize.
[2024-06-01 07:33:58] [INFO ] Deduced a trap composed of 21 places in 336 ms of which 3 ms to minimize.
[2024-06-01 07:33:59] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:33:59] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 76298ms, After SMT, problems are : Problem set: 0 solved, 1508 unsolved
Fused 1508 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 221 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 172 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 639453 steps (0 resets) in 120004 ms. (5 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1508/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1507/1508 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 89205 ms. (steps per millisecond=11 ) properties seen :0
[2024-06-01 07:36:00] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:36:00] [INFO ] Invariant cache hit.
[2024-06-01 07:36:00] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 2 (OVERLAPS) 218/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:36:52] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 5 ms to minimize.
[2024-06-01 07:36:52] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 4 ms to minimize.
[2024-06-01 07:36:53] [INFO ] Deduced a trap composed of 35 places in 444 ms of which 5 ms to minimize.
[2024-06-01 07:36:53] [INFO ] Deduced a trap composed of 26 places in 472 ms of which 4 ms to minimize.
[2024-06-01 07:36:54] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 4 ms to minimize.
[2024-06-01 07:36:54] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:36:54] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 3 ms to minimize.
[2024-06-01 07:36:54] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:36:55] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:36:55] [INFO ] Deduced a trap composed of 94 places in 415 ms of which 4 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 4 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 88 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:36:56] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:36:57] [INFO ] Deduced a trap composed of 94 places in 444 ms of which 4 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 119 places in 466 ms of which 6 ms to minimize.
[2024-06-01 07:36:58] [INFO ] Deduced a trap composed of 83 places in 461 ms of which 5 ms to minimize.
[2024-06-01 07:36:59] [INFO ] Deduced a trap composed of 98 places in 460 ms of which 4 ms to minimize.
[2024-06-01 07:36:59] [INFO ] Deduced a trap composed of 99 places in 394 ms of which 4 ms to minimize.
[2024-06-01 07:37:00] [INFO ] Deduced a trap composed of 97 places in 396 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:37:02] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:37:02] [INFO ] Deduced a trap composed of 70 places in 505 ms of which 4 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 4 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 24 places in 405 ms of which 4 ms to minimize.
[2024-06-01 07:37:03] [INFO ] Deduced a trap composed of 89 places in 391 ms of which 4 ms to minimize.
[2024-06-01 07:37:04] [INFO ] Deduced a trap composed of 104 places in 337 ms of which 4 ms to minimize.
[2024-06-01 07:37:04] [INFO ] Deduced a trap composed of 84 places in 506 ms of which 5 ms to minimize.
[2024-06-01 07:37:05] [INFO ] Deduced a trap composed of 92 places in 359 ms of which 4 ms to minimize.
[2024-06-01 07:37:05] [INFO ] Deduced a trap composed of 121 places in 401 ms of which 4 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 89 places in 372 ms of which 3 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 126 places in 398 ms of which 4 ms to minimize.
[2024-06-01 07:37:06] [INFO ] Deduced a trap composed of 133 places in 378 ms of which 4 ms to minimize.
[2024-06-01 07:37:07] [INFO ] Deduced a trap composed of 83 places in 373 ms of which 3 ms to minimize.
[2024-06-01 07:37:07] [INFO ] Deduced a trap composed of 146 places in 420 ms of which 4 ms to minimize.
[2024-06-01 07:37:08] [INFO ] Deduced a trap composed of 118 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:37:08] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:37:08] [INFO ] Deduced a trap composed of 103 places in 405 ms of which 4 ms to minimize.
[2024-06-01 07:37:09] [INFO ] Deduced a trap composed of 106 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:37:09] [INFO ] Deduced a trap composed of 96 places in 342 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 106 places in 431 ms of which 4 ms to minimize.
[2024-06-01 07:37:11] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 5 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 107 places in 492 ms of which 5 ms to minimize.
[2024-06-01 07:37:12] [INFO ] Deduced a trap composed of 36 places in 462 ms of which 6 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 94 places in 466 ms of which 4 ms to minimize.
[2024-06-01 07:37:13] [INFO ] Deduced a trap composed of 82 places in 445 ms of which 4 ms to minimize.
[2024-06-01 07:37:14] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 4 ms to minimize.
[2024-06-01 07:37:14] [INFO ] Deduced a trap composed of 30 places in 450 ms of which 5 ms to minimize.
[2024-06-01 07:37:15] [INFO ] Deduced a trap composed of 114 places in 473 ms of which 5 ms to minimize.
[2024-06-01 07:37:15] [INFO ] Deduced a trap composed of 105 places in 542 ms of which 6 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 31 places in 629 ms of which 6 ms to minimize.
[2024-06-01 07:37:16] [INFO ] Deduced a trap composed of 88 places in 538 ms of which 6 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 104 places in 544 ms of which 6 ms to minimize.
[2024-06-01 07:37:17] [INFO ] Deduced a trap composed of 3 places in 501 ms of which 4 ms to minimize.
[2024-06-01 07:37:18] [INFO ] Deduced a trap composed of 121 places in 465 ms of which 4 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 133 places in 492 ms of which 6 ms to minimize.
[2024-06-01 07:37:19] [INFO ] Deduced a trap composed of 115 places in 531 ms of which 4 ms to minimize.
[2024-06-01 07:37:20] [INFO ] Deduced a trap composed of 26 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:37:20] [INFO ] Deduced a trap composed of 127 places in 485 ms of which 6 ms to minimize.
[2024-06-01 07:37:21] [INFO ] Deduced a trap composed of 70 places in 575 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1471 variables, and 85 constraints, problems are : Problem set: 0 solved, 1507 unsolved in 90036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 1507/1507 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 2 (OVERLAPS) 218/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:37:52] [INFO ] Deduced a trap composed of 102 places in 470 ms of which 8 ms to minimize.
[2024-06-01 07:37:52] [INFO ] Deduced a trap composed of 87 places in 484 ms of which 5 ms to minimize.
[2024-06-01 07:37:53] [INFO ] Deduced a trap composed of 102 places in 498 ms of which 4 ms to minimize.
[2024-06-01 07:37:53] [INFO ] Deduced a trap composed of 89 places in 452 ms of which 4 ms to minimize.
[2024-06-01 07:37:54] [INFO ] Deduced a trap composed of 67 places in 456 ms of which 4 ms to minimize.
[2024-06-01 07:37:54] [INFO ] Deduced a trap composed of 115 places in 454 ms of which 4 ms to minimize.
[2024-06-01 07:37:55] [INFO ] Deduced a trap composed of 126 places in 452 ms of which 4 ms to minimize.
[2024-06-01 07:37:55] [INFO ] Deduced a trap composed of 92 places in 461 ms of which 4 ms to minimize.
[2024-06-01 07:37:56] [INFO ] Deduced a trap composed of 95 places in 555 ms of which 7 ms to minimize.
[2024-06-01 07:37:56] [INFO ] Deduced a trap composed of 87 places in 587 ms of which 5 ms to minimize.
[2024-06-01 07:37:57] [INFO ] Deduced a trap composed of 93 places in 408 ms of which 4 ms to minimize.
[2024-06-01 07:37:57] [INFO ] Deduced a trap composed of 129 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 4 ms to minimize.
[2024-06-01 07:37:58] [INFO ] Deduced a trap composed of 88 places in 440 ms of which 4 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 100 places in 422 ms of which 4 ms to minimize.
[2024-06-01 07:37:59] [INFO ] Deduced a trap composed of 52 places in 441 ms of which 4 ms to minimize.
[2024-06-01 07:38:00] [INFO ] Deduced a trap composed of 97 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:38:00] [INFO ] Deduced a trap composed of 81 places in 401 ms of which 4 ms to minimize.
[2024-06-01 07:38:00] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 7 ms to minimize.
[2024-06-01 07:38:01] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:38:05] [INFO ] Deduced a trap composed of 89 places in 396 ms of which 4 ms to minimize.
[2024-06-01 07:38:06] [INFO ] Deduced a trap composed of 91 places in 572 ms of which 6 ms to minimize.
[2024-06-01 07:38:07] [INFO ] Deduced a trap composed of 75 places in 515 ms of which 6 ms to minimize.
[2024-06-01 07:38:07] [INFO ] Deduced a trap composed of 101 places in 373 ms of which 4 ms to minimize.
[2024-06-01 07:38:08] [INFO ] Deduced a trap composed of 92 places in 558 ms of which 5 ms to minimize.
[2024-06-01 07:38:08] [INFO ] Deduced a trap composed of 98 places in 466 ms of which 6 ms to minimize.
[2024-06-01 07:38:09] [INFO ] Deduced a trap composed of 84 places in 436 ms of which 4 ms to minimize.
[2024-06-01 07:38:09] [INFO ] Deduced a trap composed of 19 places in 387 ms of which 4 ms to minimize.
[2024-06-01 07:38:10] [INFO ] Deduced a trap composed of 17 places in 378 ms of which 4 ms to minimize.
[2024-06-01 07:38:10] [INFO ] Deduced a trap composed of 59 places in 455 ms of which 5 ms to minimize.
[2024-06-01 07:38:10] [INFO ] Deduced a trap composed of 92 places in 338 ms of which 3 ms to minimize.
[2024-06-01 07:38:11] [INFO ] Deduced a trap composed of 59 places in 478 ms of which 5 ms to minimize.
[2024-06-01 07:38:12] [INFO ] Deduced a trap composed of 121 places in 365 ms of which 4 ms to minimize.
[2024-06-01 07:38:12] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:38:13] [INFO ] Deduced a trap composed of 102 places in 462 ms of which 4 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 115 places in 472 ms of which 4 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:38:14] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:38:16] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 4 ms to minimize.
[2024-06-01 07:38:19] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:38:20] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 4 ms to minimize.
[2024-06-01 07:38:20] [INFO ] Deduced a trap composed of 21 places in 455 ms of which 5 ms to minimize.
[2024-06-01 07:38:21] [INFO ] Deduced a trap composed of 76 places in 413 ms of which 4 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 91 places in 329 ms of which 4 ms to minimize.
[2024-06-01 07:38:22] [INFO ] Deduced a trap composed of 108 places in 445 ms of which 4 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 88 places in 450 ms of which 4 ms to minimize.
[2024-06-01 07:38:23] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 4 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 81 places in 434 ms of which 4 ms to minimize.
[2024-06-01 07:38:24] [INFO ] Deduced a trap composed of 81 places in 405 ms of which 4 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 92 places in 406 ms of which 4 ms to minimize.
[2024-06-01 07:38:25] [INFO ] Deduced a trap composed of 67 places in 459 ms of which 4 ms to minimize.
[2024-06-01 07:38:26] [INFO ] Deduced a trap composed of 51 places in 469 ms of which 4 ms to minimize.
[2024-06-01 07:38:26] [INFO ] Deduced a trap composed of 102 places in 410 ms of which 4 ms to minimize.
[2024-06-01 07:38:27] [INFO ] Deduced a trap composed of 110 places in 394 ms of which 4 ms to minimize.
[2024-06-01 07:38:27] [INFO ] Deduced a trap composed of 98 places in 438 ms of which 4 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 74 places in 460 ms of which 5 ms to minimize.
[2024-06-01 07:38:28] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:38:30] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:38:33] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 4 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 108 places in 376 ms of which 4 ms to minimize.
[2024-06-01 07:38:34] [INFO ] Deduced a trap composed of 111 places in 374 ms of which 4 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 85 places in 374 ms of which 4 ms to minimize.
[2024-06-01 07:38:35] [INFO ] Deduced a trap composed of 81 places in 529 ms of which 6 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 111 places in 375 ms of which 5 ms to minimize.
[2024-06-01 07:38:36] [INFO ] Deduced a trap composed of 92 places in 394 ms of which 4 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 107 places in 390 ms of which 4 ms to minimize.
[2024-06-01 07:38:37] [INFO ] Deduced a trap composed of 117 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 96 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:38:38] [INFO ] Deduced a trap composed of 60 places in 446 ms of which 4 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 57 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:38:39] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 5 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 79 places in 397 ms of which 4 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 118 places in 420 ms of which 4 ms to minimize.
[2024-06-01 07:38:40] [INFO ] Deduced a trap composed of 75 places in 424 ms of which 4 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 82 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:38:41] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 4 ms to minimize.
[2024-06-01 07:38:42] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:38:47] [INFO ] Deduced a trap composed of 80 places in 454 ms of which 4 ms to minimize.
[2024-06-01 07:38:48] [INFO ] Deduced a trap composed of 82 places in 463 ms of which 4 ms to minimize.
[2024-06-01 07:38:48] [INFO ] Deduced a trap composed of 56 places in 412 ms of which 4 ms to minimize.
[2024-06-01 07:38:48] [INFO ] Deduced a trap composed of 113 places in 425 ms of which 4 ms to minimize.
[2024-06-01 07:38:49] [INFO ] Deduced a trap composed of 79 places in 438 ms of which 4 ms to minimize.
[2024-06-01 07:38:49] [INFO ] Deduced a trap composed of 101 places in 428 ms of which 5 ms to minimize.
[2024-06-01 07:38:50] [INFO ] Deduced a trap composed of 80 places in 416 ms of which 4 ms to minimize.
[2024-06-01 07:38:50] [INFO ] Deduced a trap composed of 96 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:38:51] [INFO ] Deduced a trap composed of 72 places in 408 ms of which 5 ms to minimize.
[2024-06-01 07:38:51] [INFO ] Deduced a trap composed of 73 places in 428 ms of which 4 ms to minimize.
[2024-06-01 07:38:52] [INFO ] Deduced a trap composed of 55 places in 413 ms of which 4 ms to minimize.
[2024-06-01 07:38:52] [INFO ] Deduced a trap composed of 120 places in 353 ms of which 3 ms to minimize.
[2024-06-01 07:38:53] [INFO ] Deduced a trap composed of 100 places in 340 ms of which 3 ms to minimize.
[2024-06-01 07:38:53] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 5 ms to minimize.
[2024-06-01 07:38:54] [INFO ] Deduced a trap composed of 85 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:38:54] [INFO ] Deduced a trap composed of 75 places in 452 ms of which 5 ms to minimize.
[2024-06-01 07:38:55] [INFO ] Deduced a trap composed of 58 places in 446 ms of which 4 ms to minimize.
[2024-06-01 07:38:55] [INFO ] Deduced a trap composed of 41 places in 521 ms of which 6 ms to minimize.
[2024-06-01 07:38:56] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 4 ms to minimize.
[2024-06-01 07:38:56] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1471 variables, and 185 constraints, problems are : Problem set: 0 solved, 1507 unsolved in 90042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/439 constraints, ReadFeed: 0/613 constraints, PredecessorRefiner: 0/1507 constraints, Known Traps: 160/160 constraints]
After SMT, in 181145ms problems are : Problem set: 0 solved, 1507 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 221 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 95 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 1021611 steps (0 resets) in 120004 ms. (8 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1507/1507 properties
Interrupted probabilistic random walk after 840987 steps, run timeout after 93001 ms. (steps per millisecond=9 ) properties seen :0 out of 1507
Probabilistic random walk after 840987 steps, saw 542522 distinct states, run finished after 93002 ms. (steps per millisecond=9 ) properties seen :0
[2024-06-01 07:41:06] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:41:06] [INFO ] Invariant cache hit.
[2024-06-01 07:41:06] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 2 (OVERLAPS) 218/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:41:46] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:41:46] [INFO ] Deduced a trap composed of 30 places in 581 ms of which 4 ms to minimize.
[2024-06-01 07:41:47] [INFO ] Deduced a trap composed of 35 places in 518 ms of which 4 ms to minimize.
[2024-06-01 07:41:47] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 4 ms to minimize.
[2024-06-01 07:41:48] [INFO ] Deduced a trap composed of 29 places in 563 ms of which 4 ms to minimize.
[2024-06-01 07:41:48] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:41:48] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:41:48] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:41:49] [INFO ] Deduced a trap composed of 94 places in 415 ms of which 5 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 73 places in 369 ms of which 4 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 88 places in 352 ms of which 4 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:41:50] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 94 places in 461 ms of which 5 ms to minimize.
[2024-06-01 07:41:52] [INFO ] Deduced a trap composed of 119 places in 461 ms of which 4 ms to minimize.
[2024-06-01 07:41:53] [INFO ] Deduced a trap composed of 83 places in 559 ms of which 4 ms to minimize.
[2024-06-01 07:41:53] [INFO ] Deduced a trap composed of 98 places in 461 ms of which 4 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 99 places in 399 ms of which 4 ms to minimize.
[2024-06-01 07:41:54] [INFO ] Deduced a trap composed of 97 places in 389 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:41:56] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 4 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 70 places in 415 ms of which 4 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:41:57] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 4 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 89 places in 390 ms of which 4 ms to minimize.
[2024-06-01 07:41:58] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 4 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 84 places in 384 ms of which 4 ms to minimize.
[2024-06-01 07:41:59] [INFO ] Deduced a trap composed of 92 places in 394 ms of which 4 ms to minimize.
[2024-06-01 07:42:00] [INFO ] Deduced a trap composed of 121 places in 469 ms of which 6 ms to minimize.
[2024-06-01 07:42:00] [INFO ] Deduced a trap composed of 89 places in 410 ms of which 3 ms to minimize.
[2024-06-01 07:42:00] [INFO ] Deduced a trap composed of 126 places in 377 ms of which 4 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 133 places in 348 ms of which 4 ms to minimize.
[2024-06-01 07:42:01] [INFO ] Deduced a trap composed of 83 places in 346 ms of which 3 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 146 places in 369 ms of which 4 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 4 ms to minimize.
[2024-06-01 07:42:02] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 103 places in 518 ms of which 6 ms to minimize.
[2024-06-01 07:42:03] [INFO ] Deduced a trap composed of 106 places in 358 ms of which 4 ms to minimize.
[2024-06-01 07:42:04] [INFO ] Deduced a trap composed of 96 places in 414 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 106 places in 517 ms of which 6 ms to minimize.
[2024-06-01 07:42:06] [INFO ] Deduced a trap composed of 31 places in 533 ms of which 4 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 107 places in 437 ms of which 4 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 36 places in 451 ms of which 4 ms to minimize.
[2024-06-01 07:42:07] [INFO ] Deduced a trap composed of 94 places in 459 ms of which 4 ms to minimize.
[2024-06-01 07:42:08] [INFO ] Deduced a trap composed of 82 places in 449 ms of which 4 ms to minimize.
[2024-06-01 07:42:08] [INFO ] Deduced a trap composed of 31 places in 486 ms of which 6 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 30 places in 558 ms of which 4 ms to minimize.
[2024-06-01 07:42:09] [INFO ] Deduced a trap composed of 114 places in 440 ms of which 4 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 105 places in 448 ms of which 4 ms to minimize.
[2024-06-01 07:42:10] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 4 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 88 places in 446 ms of which 4 ms to minimize.
[2024-06-01 07:42:11] [INFO ] Deduced a trap composed of 104 places in 479 ms of which 6 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 3 places in 555 ms of which 4 ms to minimize.
[2024-06-01 07:42:12] [INFO ] Deduced a trap composed of 121 places in 447 ms of which 4 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 133 places in 443 ms of which 5 ms to minimize.
[2024-06-01 07:42:13] [INFO ] Deduced a trap composed of 115 places in 448 ms of which 5 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 26 places in 413 ms of which 5 ms to minimize.
[2024-06-01 07:42:14] [INFO ] Deduced a trap composed of 127 places in 401 ms of which 5 ms to minimize.
[2024-06-01 07:42:15] [INFO ] Deduced a trap composed of 70 places in 406 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 5 ms to minimize.
[2024-06-01 07:42:33] [INFO ] Deduced a trap composed of 99 places in 466 ms of which 5 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 100 places in 390 ms of which 4 ms to minimize.
[2024-06-01 07:42:34] [INFO ] Deduced a trap composed of 96 places in 380 ms of which 4 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 110 places in 431 ms of which 4 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 109 places in 406 ms of which 5 ms to minimize.
[2024-06-01 07:42:35] [INFO ] Deduced a trap composed of 102 places in 402 ms of which 4 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 111 places in 397 ms of which 4 ms to minimize.
[2024-06-01 07:42:36] [INFO ] Deduced a trap composed of 94 places in 461 ms of which 4 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 99 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:42:37] [INFO ] Deduced a trap composed of 122 places in 441 ms of which 4 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 4 ms to minimize.
[2024-06-01 07:42:38] [INFO ] Deduced a trap composed of 89 places in 422 ms of which 4 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 97 places in 433 ms of which 4 ms to minimize.
[2024-06-01 07:42:39] [INFO ] Deduced a trap composed of 106 places in 440 ms of which 5 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 90 places in 422 ms of which 4 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 109 places in 403 ms of which 4 ms to minimize.
[2024-06-01 07:42:40] [INFO ] Deduced a trap composed of 108 places in 418 ms of which 5 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 101 places in 423 ms of which 4 ms to minimize.
[2024-06-01 07:42:41] [INFO ] Deduced a trap composed of 85 places in 390 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 111 places in 422 ms of which 4 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 94 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:42:44] [INFO ] Deduced a trap composed of 110 places in 419 ms of which 4 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 115 places in 422 ms of which 5 ms to minimize.
[2024-06-01 07:42:45] [INFO ] Deduced a trap composed of 100 places in 445 ms of which 4 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 67 places in 430 ms of which 5 ms to minimize.
[2024-06-01 07:42:46] [INFO ] Deduced a trap composed of 95 places in 452 ms of which 4 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 98 places in 411 ms of which 5 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 18 places in 467 ms of which 4 ms to minimize.
[2024-06-01 07:42:47] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 3 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:42:48] [INFO ] Deduced a trap composed of 91 places in 436 ms of which 5 ms to minimize.
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 93 places in 432 ms of which 4 ms to minimize.
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 79 places in 468 ms of which 4 ms to minimize.
[2024-06-01 07:42:49] [INFO ] Deduced a trap composed of 113 places in 363 ms of which 4 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 94 places in 459 ms of which 4 ms to minimize.
[2024-06-01 07:42:50] [INFO ] Deduced a trap composed of 86 places in 411 ms of which 4 ms to minimize.
[2024-06-01 07:42:51] [INFO ] Deduced a trap composed of 122 places in 467 ms of which 4 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 105 places in 537 ms of which 4 ms to minimize.
[2024-06-01 07:42:52] [INFO ] Deduced a trap composed of 121 places in 458 ms of which 4 ms to minimize.
SMT process timed out in 106415ms, After SMT, problems are : Problem set: 0 solved, 1507 unsolved
Fused 1507 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 221 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 92 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 89 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2024-06-01 07:42:52] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:42:52] [INFO ] Invariant cache hit.
[2024-06-01 07:42:53] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 07:42:53] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:42:53] [INFO ] Invariant cache hit.
[2024-06-01 07:42:53] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-06-01 07:42:54] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2024-06-01 07:42:54] [INFO ] Redundant transitions in 187 ms returned []
Running 2472 sub problems to find dead transitions.
[2024-06-01 07:42:54] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:42:54] [INFO ] Invariant cache hit.
[2024-06-01 07:42:54] [INFO ] State equation strengthened by 613 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/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
SMT process timed out in 31652ms, After SMT, problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 31679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33904 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 7803 ms. (51 steps per ms) remains 103/221 properties
Running SMT prover for 103 properties.
[2024-06-01 07:43:28] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:43:28] [INFO ] Invariant cache hit.
[2024-06-01 07:43:29] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 07:43:29] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2024-06-01 07:43:29] [INFO ] After 754ms SMT Verify possible using state equation in real domain returned unsat :0 sat :103
[2024-06-01 07:43:29] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-06-01 07:43:31] [INFO ] After 1211ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :103
TRAPS : Iteration 0
[2024-06-01 07:43:42] [INFO ] After 12450ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:103
[2024-06-01 07:43:42] [INFO ] After 13461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:103
[2024-06-01 07:43:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2024-06-01 07:43:42] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 07:43:43] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :103
[2024-06-01 07:43:44] [INFO ] After 977ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :103
TRAPS : Iteration 0
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 3 places in 634 ms of which 7 ms to minimize.
[2024-06-01 07:43:45] [INFO ] Deduced a trap composed of 3 places in 679 ms of which 7 ms to minimize.
[2024-06-01 07:43:46] [INFO ] Deduced a trap composed of 49 places in 592 ms of which 6 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 97 places in 586 ms of which 6 ms to minimize.
[2024-06-01 07:43:47] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 5 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 45 places in 519 ms of which 5 ms to minimize.
[2024-06-01 07:43:48] [INFO ] Deduced a trap composed of 47 places in 502 ms of which 5 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 55 places in 526 ms of which 5 ms to minimize.
[2024-06-01 07:43:49] [INFO ] Deduced a trap composed of 36 places in 511 ms of which 6 ms to minimize.
[2024-06-01 07:43:50] [INFO ] Deduced a trap composed of 32 places in 541 ms of which 6 ms to minimize.
[2024-06-01 07:43:51] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 6 ms to minimize.
[2024-06-01 07:43:51] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:43:51] [INFO ] Deduced a trap composed of 35 places in 499 ms of which 5 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 29 places in 537 ms of which 6 ms to minimize.
[2024-06-01 07:43:52] [INFO ] Deduced a trap composed of 25 places in 507 ms of which 5 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Deduced a trap composed of 21 places in 546 ms of which 6 ms to minimize.
[2024-06-01 07:43:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9223 ms
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 4 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 3 ms to minimize.
[2024-06-01 07:43:54] [INFO ] Deduced a trap composed of 58 places in 339 ms of which 3 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 4 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 4 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:43:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2085 ms
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 4 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 4 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 662 ms
[2024-06-01 07:43:56] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:43:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-06-01 07:43:58] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:44:00] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:44:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:44:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2024-06-01 07:44:03] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2024-06-01 07:44:04] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 3 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:44:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 986 ms
[2024-06-01 07:44:06] [INFO ] Deduced a trap composed of 82 places in 683 ms of which 6 ms to minimize.
[2024-06-01 07:44:07] [INFO ] Deduced a trap composed of 87 places in 576 ms of which 6 ms to minimize.
[2024-06-01 07:44:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1468 ms
[2024-06-01 07:44:07] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 4 ms to minimize.
[2024-06-01 07:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 4 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 3 ms to minimize.
[2024-06-01 07:44:09] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 4 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:44:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2136 ms
TRAPS : Iteration 1
[2024-06-01 07:44:15] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-06-01 07:44:16] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 3 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 3 ms to minimize.
[2024-06-01 07:44:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 947 ms
[2024-06-01 07:44:18] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 2 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 2 ms to minimize.
[2024-06-01 07:44:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 644 ms
TRAPS : Iteration 2
[2024-06-01 07:44:34] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-06-01 07:44:35] [INFO ] Deduced a trap composed of 72 places in 544 ms of which 5 ms to minimize.
[2024-06-01 07:44:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 679 ms
TRAPS : Iteration 3
[2024-06-01 07:44:51] [INFO ] After 68254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :103
[2024-06-01 07:44:53] [INFO ] After 70843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :103
RANDOM walk for 601948 steps (0 resets) in 120005 ms. (5 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1507/1507 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1507/1507 properties
Probabilistic random walk after 1000001 steps, saw 636641 distinct states, run finished after 89914 ms. (steps per millisecond=11 ) properties seen :0
[2024-06-01 07:46:54] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:46:54] [INFO ] Invariant cache hit.
[2024-06-01 07:46:54] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 2 (OVERLAPS) 218/439 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:47:34] [INFO ] Deduced a trap composed of 32 places in 550 ms of which 5 ms to minimize.
[2024-06-01 07:47:35] [INFO ] Deduced a trap composed of 30 places in 580 ms of which 6 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 35 places in 656 ms of which 7 ms to minimize.
[2024-06-01 07:47:36] [INFO ] Deduced a trap composed of 26 places in 690 ms of which 6 ms to minimize.
[2024-06-01 07:47:37] [INFO ] Deduced a trap composed of 29 places in 734 ms of which 6 ms to minimize.
[2024-06-01 07:47:37] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 3 ms to minimize.
[2024-06-01 07:47:38] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 3 ms to minimize.
[2024-06-01 07:47:38] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:47:38] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 94 places in 662 ms of which 6 ms to minimize.
[2024-06-01 07:47:40] [INFO ] Deduced a trap composed of 73 places in 595 ms of which 6 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 88 places in 495 ms of which 5 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:47:41] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:47:43] [INFO ] Deduced a trap composed of 94 places in 737 ms of which 7 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 119 places in 753 ms of which 7 ms to minimize.
[2024-06-01 07:47:44] [INFO ] Deduced a trap composed of 83 places in 714 ms of which 7 ms to minimize.
[2024-06-01 07:47:45] [INFO ] Deduced a trap composed of 98 places in 723 ms of which 7 ms to minimize.
[2024-06-01 07:47:46] [INFO ] Deduced a trap composed of 99 places in 593 ms of which 6 ms to minimize.
[2024-06-01 07:47:47] [INFO ] Deduced a trap composed of 97 places in 634 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:47:49] [INFO ] Deduced a trap composed of 4 places in 702 ms of which 7 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 70 places in 704 ms of which 7 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 19 places in 502 ms of which 6 ms to minimize.
[2024-06-01 07:47:50] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:47:51] [INFO ] Deduced a trap composed of 24 places in 630 ms of which 6 ms to minimize.
[2024-06-01 07:47:52] [INFO ] Deduced a trap composed of 89 places in 638 ms of which 6 ms to minimize.
[2024-06-01 07:47:52] [INFO ] Deduced a trap composed of 104 places in 636 ms of which 7 ms to minimize.
[2024-06-01 07:47:53] [INFO ] Deduced a trap composed of 84 places in 593 ms of which 6 ms to minimize.
[2024-06-01 07:47:54] [INFO ] Deduced a trap composed of 92 places in 609 ms of which 6 ms to minimize.
[2024-06-01 07:47:54] [INFO ] Deduced a trap composed of 121 places in 623 ms of which 7 ms to minimize.
[2024-06-01 07:47:55] [INFO ] Deduced a trap composed of 89 places in 577 ms of which 6 ms to minimize.
[2024-06-01 07:47:55] [INFO ] Deduced a trap composed of 126 places in 637 ms of which 7 ms to minimize.
[2024-06-01 07:47:56] [INFO ] Deduced a trap composed of 133 places in 505 ms of which 6 ms to minimize.
[2024-06-01 07:47:57] [INFO ] Deduced a trap composed of 83 places in 553 ms of which 5 ms to minimize.
[2024-06-01 07:47:57] [INFO ] Deduced a trap composed of 146 places in 631 ms of which 7 ms to minimize.
[2024-06-01 07:47:58] [INFO ] Deduced a trap composed of 118 places in 602 ms of which 6 ms to minimize.
[2024-06-01 07:47:58] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
[2024-06-01 07:47:59] [INFO ] Deduced a trap composed of 103 places in 607 ms of which 6 ms to minimize.
[2024-06-01 07:47:59] [INFO ] Deduced a trap composed of 106 places in 573 ms of which 6 ms to minimize.
[2024-06-01 07:48:00] [INFO ] Deduced a trap composed of 96 places in 551 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:48:03] [INFO ] Deduced a trap composed of 106 places in 723 ms of which 7 ms to minimize.
[2024-06-01 07:48:03] [INFO ] Deduced a trap composed of 31 places in 752 ms of which 8 ms to minimize.
[2024-06-01 07:48:04] [INFO ] Deduced a trap composed of 107 places in 733 ms of which 7 ms to minimize.
[2024-06-01 07:48:05] [INFO ] Deduced a trap composed of 36 places in 725 ms of which 7 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 94 places in 718 ms of which 7 ms to minimize.
[2024-06-01 07:48:06] [INFO ] Deduced a trap composed of 82 places in 745 ms of which 7 ms to minimize.
[2024-06-01 07:48:07] [INFO ] Deduced a trap composed of 31 places in 670 ms of which 7 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 30 places in 732 ms of which 7 ms to minimize.
[2024-06-01 07:48:08] [INFO ] Deduced a trap composed of 114 places in 721 ms of which 7 ms to minimize.
[2024-06-01 07:48:09] [INFO ] Deduced a trap composed of 105 places in 622 ms of which 6 ms to minimize.
[2024-06-01 07:48:10] [INFO ] Deduced a trap composed of 31 places in 723 ms of which 7 ms to minimize.
[2024-06-01 07:48:11] [INFO ] Deduced a trap composed of 88 places in 707 ms of which 7 ms to minimize.
[2024-06-01 07:48:11] [INFO ] Deduced a trap composed of 104 places in 739 ms of which 7 ms to minimize.
[2024-06-01 07:48:12] [INFO ] Deduced a trap composed of 3 places in 724 ms of which 7 ms to minimize.
[2024-06-01 07:48:13] [INFO ] Deduced a trap composed of 121 places in 652 ms of which 7 ms to minimize.
[2024-06-01 07:48:14] [INFO ] Deduced a trap composed of 133 places in 839 ms of which 7 ms to minimize.
[2024-06-01 07:48:14] [INFO ] Deduced a trap composed of 115 places in 742 ms of which 7 ms to minimize.
[2024-06-01 07:48:15] [INFO ] Deduced a trap composed of 26 places in 669 ms of which 7 ms to minimize.
[2024-06-01 07:48:16] [INFO ] Deduced a trap composed of 127 places in 662 ms of which 6 ms to minimize.
[2024-06-01 07:48:17] [INFO ] Deduced a trap composed of 70 places in 666 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1507 unsolved
[2024-06-01 07:48:43] [INFO ] Deduced a trap composed of 24 places in 754 ms of which 7 ms to minimize.
[2024-06-01 07:48:43] [INFO ] Deduced a trap composed of 99 places in 761 ms of which 7 ms to minimize.
[2024-06-01 07:48:44] [INFO ] Deduced a trap composed of 100 places in 677 ms of which 6 ms to minimize.
[2024-06-01 07:48:45] [INFO ] Deduced a trap composed of 96 places in 683 ms of which 6 ms to minimize.
[2024-06-01 07:48:46] [INFO ] Deduced a trap composed of 110 places in 769 ms of which 7 ms to minimize.
[2024-06-01 07:48:47] [INFO ] Deduced a trap composed of 109 places in 677 ms of which 7 ms to minimize.
[2024-06-01 07:48:47] [INFO ] Deduced a trap composed of 102 places in 754 ms of which 6 ms to minimize.
[2024-06-01 07:48:48] [INFO ] Deduced a trap composed of 111 places in 726 ms of which 7 ms to minimize.
[2024-06-01 07:48:49] [INFO ] Deduced a trap composed of 94 places in 691 ms of which 7 ms to minimize.
[2024-06-01 07:48:50] [INFO ] Deduced a trap composed of 99 places in 739 ms of which 8 ms to minimize.
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 122 places in 756 ms of which 7 ms to minimize.
[2024-06-01 07:48:51] [INFO ] Deduced a trap composed of 104 places in 748 ms of which 7 ms to minimize.
[2024-06-01 07:48:52] [INFO ] Deduced a trap composed of 89 places in 652 ms of which 6 ms to minimize.
[2024-06-01 07:48:53] [INFO ] Deduced a trap composed of 97 places in 728 ms of which 6 ms to minimize.
[2024-06-01 07:48:54] [INFO ] Deduced a trap composed of 106 places in 727 ms of which 7 ms to minimize.
[2024-06-01 07:48:54] [INFO ] Deduced a trap composed of 90 places in 707 ms of which 7 ms to minimize.
[2024-06-01 07:48:55] [INFO ] Deduced a trap composed of 109 places in 638 ms of which 6 ms to minimize.
[2024-06-01 07:48:56] [INFO ] Deduced a trap composed of 108 places in 725 ms of which 7 ms to minimize.
SMT process timed out in 121544ms, After SMT, problems are : Problem set: 0 solved, 1507 unsolved
Fused 1507 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 221 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 145 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 439/439 places, 2480/2480 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Applied a total of 0 rules in 144 ms. Remains 439 /439 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
[2024-06-01 07:48:56] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:48:56] [INFO ] Invariant cache hit.
[2024-06-01 07:48:56] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-06-01 07:48:57] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:48:57] [INFO ] Invariant cache hit.
[2024-06-01 07:48:57] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-06-01 07:48:59] [INFO ] Implicit Places using invariants and state equation in 2338 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
[2024-06-01 07:48:59] [INFO ] Redundant transitions in 123 ms returned []
Running 2472 sub problems to find dead transitions.
[2024-06-01 07:48:59] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:48:59] [INFO ] Invariant cache hit.
[2024-06-01 07:48:59] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2472 unsolved
SMT process timed out in 32030ms, After SMT, problems are : Problem set: 0 solved, 2472 unsolved
Search for dead transitions found 0 dead transitions in 32071ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35253 ms. Remains : 439/439 places, 2480/2480 transitions.
RANDOM walk for 400000 steps (8 resets) in 11403 ms. (35 steps per ms) remains 103/221 properties
Running SMT prover for 103 properties.
[2024-06-01 07:49:36] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:49:36] [INFO ] Invariant cache hit.
[2024-06-01 07:49:36] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 07:49:36] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 07:49:37] [INFO ] After 781ms SMT Verify possible using state equation in real domain returned unsat :0 sat :103
[2024-06-01 07:49:37] [INFO ] State equation strengthened by 613 read => feed constraints.
[2024-06-01 07:49:38] [INFO ] After 1161ms SMT Verify possible using 613 Read/Feed constraints in real domain returned unsat :0 sat :103
TRAPS : Iteration 0
[2024-06-01 07:49:47] [INFO ] After 10097ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:103
[2024-06-01 07:49:47] [INFO ] After 11181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:103
[2024-06-01 07:49:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2024-06-01 07:49:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2024-06-01 07:49:48] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :103
[2024-06-01 07:49:49] [INFO ] After 1425ms SMT Verify possible using 613 Read/Feed constraints in natural domain returned unsat :0 sat :103
TRAPS : Iteration 0
[2024-06-01 07:49:50] [INFO ] Deduced a trap composed of 3 places in 682 ms of which 6 ms to minimize.
[2024-06-01 07:49:51] [INFO ] Deduced a trap composed of 3 places in 699 ms of which 6 ms to minimize.
[2024-06-01 07:49:52] [INFO ] Deduced a trap composed of 3 places in 632 ms of which 6 ms to minimize.
[2024-06-01 07:49:52] [INFO ] Deduced a trap composed of 3 places in 522 ms of which 5 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 5 ms to minimize.
[2024-06-01 07:49:53] [INFO ] Deduced a trap composed of 53 places in 390 ms of which 5 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 31 places in 439 ms of which 5 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 4 ms to minimize.
[2024-06-01 07:49:54] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:49:55] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 15 ms to minimize.
[2024-06-01 07:49:55] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:49:55] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 3 ms to minimize.
[2024-06-01 07:49:56] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:49:56] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 3 ms to minimize.
[2024-06-01 07:49:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6659 ms
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 33 places in 437 ms of which 5 ms to minimize.
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 15 places in 341 ms of which 4 ms to minimize.
[2024-06-01 07:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 957 ms
[2024-06-01 07:49:57] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-01 07:49:58] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2024-06-01 07:49:58] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:49:59] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:49:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2024-06-01 07:49:59] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 3 ms to minimize.
[2024-06-01 07:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2024-06-01 07:50:00] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 3 ms to minimize.
[2024-06-01 07:50:00] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 4 ms to minimize.
[2024-06-01 07:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 837 ms
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2024-06-01 07:50:01] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-01 07:50:02] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-06-01 07:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2024-06-01 07:50:03] [INFO ] Deduced a trap composed of 116 places in 579 ms of which 6 ms to minimize.
[2024-06-01 07:50:03] [INFO ] Deduced a trap composed of 93 places in 533 ms of which 6 ms to minimize.
[2024-06-01 07:50:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1307 ms
[2024-06-01 07:50:05] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2024-06-01 07:50:06] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 3 ms to minimize.
[2024-06-01 07:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2024-06-01 07:50:06] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2024-06-01 07:50:07] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-06-01 07:50:07] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:50:08] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 3 ms to minimize.
[2024-06-01 07:50:08] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:50:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 813 ms
[2024-06-01 07:50:08] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:50:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 556 ms
[2024-06-01 07:50:10] [INFO ] Deduced a trap composed of 85 places in 593 ms of which 5 ms to minimize.
[2024-06-01 07:50:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 715 ms
[2024-06-01 07:50:11] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 4 ms to minimize.
[2024-06-01 07:50:11] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:50:11] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:50:11] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:50:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1161 ms
[2024-06-01 07:50:12] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:50:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-06-01 07:50:14] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 3 ms to minimize.
[2024-06-01 07:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2024-06-01 07:50:15] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:50:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
TRAPS : Iteration 1
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 3 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:50:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2024-06-01 07:50:19] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
[2024-06-01 07:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-06-01 07:50:20] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-06-01 07:50:23] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2024-06-01 07:50:26] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
TRAPS : Iteration 2
[2024-06-01 07:50:32] [INFO ] Deduced a trap composed of 64 places in 655 ms of which 6 ms to minimize.
[2024-06-01 07:50:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 789 ms
[2024-06-01 07:50:36] [INFO ] Deduced a trap composed of 99 places in 662 ms of which 6 ms to minimize.
[2024-06-01 07:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 784 ms
[2024-06-01 07:50:38] [INFO ] Deduced a trap composed of 68 places in 599 ms of which 5 ms to minimize.
[2024-06-01 07:50:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 726 ms
[2024-06-01 07:50:38] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:50:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
TRAPS : Iteration 3
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 100 places in 661 ms of which 7 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 795 ms
[2024-06-01 07:50:47] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:50:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-06-01 07:50:48] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-06-01 07:50:49] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
TRAPS : Iteration 4
[2024-06-01 07:51:05] [INFO ] After 76671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :103
[2024-06-01 07:51:07] [INFO ] After 79816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :103
RANDOM walk for 547 steps (0 resets) in 10 ms. (49 steps per ms) remains 0/1 properties
RANDOM walk for 1240 steps (0 resets) in 13 ms. (88 steps per ms) remains 0/1 properties
RANDOM walk for 1683 steps (0 resets) in 14 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 948 steps (0 resets) in 9 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 1887 steps (0 resets) in 15 ms. (117 steps per ms) remains 0/1 properties
RANDOM walk for 1554 steps (0 resets) in 12 ms. (119 steps per ms) remains 0/1 properties
RANDOM walk for 2487 steps (0 resets) in 18 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 2090 steps (0 resets) in 15 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 3189 steps (0 resets) in 26 ms. (118 steps per ms) remains 0/1 properties
RANDOM walk for 2402 steps (0 resets) in 17 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 3891 steps (0 resets) in 29 ms. (129 steps per ms) remains 0/1 properties
RANDOM walk for 3035 steps (0 resets) in 22 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 116 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
RANDOM walk for 3498 steps (0 resets) in 26 ms. (129 steps per ms) remains 0/1 properties
RANDOM walk for 1622 steps (0 resets) in 11 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 2075 steps (0 resets) in 18 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 2599 steps (0 resets) in 21 ms. (118 steps per ms) remains 0/1 properties
RANDOM walk for 3294 steps (0 resets) in 25 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 3613 steps (0 resets) in 18 ms. (190 steps per ms) remains 0/1 properties
RANDOM walk for 131 steps (0 resets) in 8 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 586 steps (0 resets) in 7 ms. (73 steps per ms) remains 0/1 properties
RANDOM walk for 2067 steps (0 resets) in 15 ms. (129 steps per ms) remains 0/1 properties
RANDOM walk for 2400 steps (0 resets) in 18 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 3080 steps (0 resets) in 20 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 3440 steps (0 resets) in 25 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 148 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
RANDOM walk for 514 steps (0 resets) in 8 ms. (57 steps per ms) remains 0/1 properties
RANDOM walk for 1149 steps (0 resets) in 9 ms. (114 steps per ms) remains 0/1 properties
RANDOM walk for 2756 steps (0 resets) in 20 ms. (131 steps per ms) remains 0/1 properties
RANDOM walk for 3077 steps (0 resets) in 21 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 3435 steps (0 resets) in 23 ms. (143 steps per ms) remains 0/1 properties
RANDOM walk for 135 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
RANDOM walk for 527 steps (0 resets) in 6 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 961 steps (0 resets) in 8 ms. (106 steps per ms) remains 0/1 properties
RANDOM walk for 1741 steps (0 resets) in 14 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 3268 steps (0 resets) in 23 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 3822 steps (0 resets) in 26 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 565 steps (0 resets) in 8 ms. (62 steps per ms) remains 0/1 properties
RANDOM walk for 977 steps (0 resets) in 12 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 1684 steps (0 resets) in 14 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 2153 steps (0 resets) in 16 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 4006 steps (0 resets) in 27 ms. (143 steps per ms) remains 0/1 properties
RANDOM walk for 74 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 561 steps (0 resets) in 7 ms. (70 steps per ms) remains 0/1 properties
RANDOM walk for 946 steps (0 resets) in 12 ms. (72 steps per ms) remains 0/1 properties
RANDOM walk for 1380 steps (0 resets) in 12 ms. (106 steps per ms) remains 0/1 properties
RANDOM walk for 2182 steps (0 resets) in 18 ms. (114 steps per ms) remains 0/1 properties
RANDOM walk for 2479 steps (0 resets) in 19 ms. (123 steps per ms) remains 0/1 properties
RANDOM walk for 1197 steps (0 resets) in 13 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 1625 steps (0 resets) in 17 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 2045 steps (0 resets) in 13 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 527 steps (0 resets) in 6 ms. (75 steps per ms) remains 0/1 properties
RANDOM walk for 2472 steps (0 resets) in 19 ms. (123 steps per ms) remains 0/1 properties
RANDOM walk for 3284 steps (0 resets) in 23 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 36706 steps (8 resets) in 280 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 641 steps (0 resets) in 6 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 78 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 1117 steps (0 resets) in 11 ms. (93 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 63 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 1917 steps (0 resets) in 12 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 2270 steps (0 resets) in 16 ms. (133 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 2541 steps (0 resets) in 17 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 3120 steps (0 resets) in 19 ms. (156 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
RANDOM walk for 3532 steps (0 resets) in 22 ms. (153 steps per ms) remains 0/1 properties
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 319635 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 319635 steps, saw 219420 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 07:51:11] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:51:11] [INFO ] Invariant cache hit.
[2024-06-01 07:51:11] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:12] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 4 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:51:13] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 2/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2626ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 13 ms.
RANDOM walk for 102 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 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 337356 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337356 steps, saw 230775 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-06-01 07:51:17] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:51:17] [INFO ] Invariant cache hit.
[2024-06-01 07:51:17] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:17] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:18] [INFO ] Deduced a trap composed of 3 places in 595 ms of which 5 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2024-06-01 07:51:19] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:51:20] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3349ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 617 steps, including 36 resets, run visited all 1 properties in 7 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 7 ms.
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 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 318249 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 318249 steps, saw 218579 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 07:51:23] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:51:23] [INFO ] Invariant cache hit.
[2024-06-01 07:51:23] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:23] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:25] [INFO ] Deduced a trap composed of 3 places in 593 ms of which 6 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 3 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:51:26] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 196 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 342603 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342603 steps, saw 190815 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
[2024-06-01 07:51:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 07:51:30] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 07:51:30] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 28/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 246/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 28/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:31] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 3 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 246/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:51:32] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1048 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1729 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2375ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 127 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 123 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 07:51:33] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:51:33] [INFO ] Invariant cache hit.
[2024-06-01 07:51:34] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-06-01 07:51:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:51:34] [INFO ] Invariant cache hit.
[2024-06-01 07:51:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 07:51:37] [INFO ] Implicit Places using invariants and state equation in 3220 ms returned []
Implicit Place search using SMT with State Equation took 4166 ms to find 0 implicit places.
[2024-06-01 07:51:37] [INFO ] Redundant transitions in 53 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 07:51:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:51:37] [INFO ] Invariant cache hit.
[2024-06-01 07:51:37] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 3 places in 562 ms of which 6 ms to minimize.
[2024-06-01 07:52:07] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 4 ms to minimize.
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:52:08] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 4 ms to minimize.
[2024-06-01 07:52:09] [INFO ] Deduced a trap composed of 71 places in 394 ms of which 4 ms to minimize.
SMT process timed out in 31742ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31762ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36115 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 11 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 101 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 07:52:09] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 07:52:09] [INFO ] [Real]Absence check using 17 positive place invariants in 82 ms returned sat
[2024-06-01 07:52:09] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 07:52:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:52:09] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:52:09] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:52:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-06-01 07:52:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:52:09] [INFO ] After 10ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:52:09] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:52:09] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 560 ms.
RANDOM walk for 40000 steps (8 resets) in 366 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320877 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320877 steps, saw 220237 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 07:52:13] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-06-01 07:52:13] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 07:52:13] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:13] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 533/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:15] [INFO ] Deduced a trap composed of 3 places in 609 ms of which 6 ms to minimize.
[2024-06-01 07:52:15] [INFO ] Deduced a trap composed of 3 places in 512 ms of which 5 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 5 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 4 ms to minimize.
[2024-06-01 07:52:16] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 533/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3191 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 4159ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 46 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 2 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 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 308061 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 308061 steps, saw 211841 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-06-01 07:52:20] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:52:20] [INFO ] Invariant cache hit.
[2024-06-01 07:52:20] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:20] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:21] [INFO ] Deduced a trap composed of 62 places in 686 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:23] [INFO ] Deduced a trap composed of 6 places in 734 ms of which 7 ms to minimize.
[2024-06-01 07:52:23] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 5 ms to minimize.
[2024-06-01 07:52:23] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 3 ms to minimize.
[2024-06-01 07:52:24] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:52:24] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-06-01 07:52:24] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 3 ms to minimize.
[2024-06-01 07:52:24] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3349 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 5104ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 32 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 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 282987 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 282987 steps, saw 195766 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 07:52:28] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:52:28] [INFO ] Invariant cache hit.
[2024-06-01 07:52:28] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:28] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:29] [INFO ] Deduced a trap composed of 62 places in 725 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 533/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1845 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 28/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 3 places in 648 ms of which 6 ms to minimize.
[2024-06-01 07:52:31] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 5 ms to minimize.
[2024-06-01 07:52:32] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 4 ms to minimize.
[2024-06-01 07:52:32] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:52:32] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 533/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 4686ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 146 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 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
Finished probabilistic random walk after 50092 steps, run visited all 1 properties in 522 ms. (steps per millisecond=95 )
Probabilistic random walk after 50092 steps, saw 33955 distinct states, run finished after 528 ms. (steps per millisecond=94 ) properties seen :1
RANDOM walk for 35289 steps (7 resets) in 109 ms. (320 steps per ms) remains 0/1 properties
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302562 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302562 steps, saw 208472 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-06-01 07:52:37] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:52:37] [INFO ] Invariant cache hit.
[2024-06-01 07:52:37] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:37] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:38] [INFO ] Deduced a trap composed of 83 places in 716 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:39] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 5 ms to minimize.
[2024-06-01 07:52:40] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 3 ms to minimize.
[2024-06-01 07:52:40] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 3 ms to minimize.
[2024-06-01 07:52:40] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:52:40] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 4352ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 72 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 44 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 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 299151 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 299151 steps, saw 206327 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 07:52:44] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:52:44] [INFO ] Invariant cache hit.
[2024-06-01 07:52:44] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:45] [INFO ] Deduced a trap composed of 83 places in 732 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 3 places in 567 ms of which 6 ms to minimize.
[2024-06-01 07:52:47] [INFO ] Deduced a trap composed of 3 places in 491 ms of which 5 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 4 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-06-01 07:52:48] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2024-06-01 07:52:49] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 6/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3301 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5127ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18007 steps, including 430 resets, run visited all 1 properties in 115 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 115 ms.
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 280764 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 1
Probabilistic random walk after 280764 steps, saw 194436 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-06-01 07:52:52] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:52:52] [INFO ] Invariant cache hit.
[2024-06-01 07:52:52] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:54] [INFO ] Deduced a trap composed of 82 places in 700 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:52:55] [INFO ] Deduced a trap composed of 3 places in 653 ms of which 7 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 4 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 3 ms to minimize.
[2024-06-01 07:52:56] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 3 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:52:57] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3799 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 5614ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 2 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 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 300735 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 300735 steps, saw 207299 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-06-01 07:53:01] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:01] [INFO ] Invariant cache hit.
[2024-06-01 07:53:01] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:01] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:02] [INFO ] Deduced a trap composed of 93 places in 714 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1850 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:04] [INFO ] Deduced a trap composed of 73 places in 746 ms of which 7 ms to minimize.
[2024-06-01 07:53:05] [INFO ] Deduced a trap composed of 118 places in 747 ms of which 7 ms to minimize.
[2024-06-01 07:53:06] [INFO ] Deduced a trap composed of 3 places in 749 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:06] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1084 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3654 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 140 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 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
Finished probabilistic random walk after 283651 steps, run visited all 1 properties in 2614 ms. (steps per millisecond=108 )
Probabilistic random walk after 283651 steps, saw 161256 distinct states, run finished after 2614 ms. (steps per millisecond=108 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 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 335304 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335304 steps, saw 229454 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-01 07:53:13] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:13] [INFO ] Invariant cache hit.
[2024-06-01 07:53:13] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:13] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 4 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-06-01 07:53:15] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 3224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 136 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 42388 steps, run visited all 1 properties in 535 ms. (steps per millisecond=79 )
Probabilistic random walk after 42388 steps, saw 29288 distinct states, run finished after 541 ms. (steps per millisecond=78 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 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 301635 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301635 steps, saw 207780 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-06-01 07:53:20] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:20] [INFO ] Invariant cache hit.
[2024-06-01 07:53:20] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:20] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:21] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2033ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 139 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 25369 steps, run visited all 1 properties in 320 ms. (steps per millisecond=79 )
Probabilistic random walk after 25369 steps, saw 18443 distinct states, run finished after 320 ms. (steps per millisecond=79 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 125332 steps, run visited all 1 properties in 1303 ms. (steps per millisecond=96 )
Probabilistic random walk after 125332 steps, saw 90604 distinct states, run finished after 1303 ms. (steps per millisecond=96 ) properties seen :1
RANDOM walk for 31872 steps (7 resets) in 137 ms. (230 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 369288 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369288 steps, saw 251736 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 07:53:27] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:27] [INFO ] Invariant cache hit.
[2024-06-01 07:53:27] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:27] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:28] [INFO ] Deduced a trap composed of 102 places in 639 ms of which 6 ms to minimize.
[2024-06-01 07:53:29] [INFO ] Deduced a trap composed of 87 places in 654 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2346 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:30] [INFO ] Deduced a trap composed of 17 places in 674 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 1/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1083 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4340ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 73 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 2 ms.
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 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321633 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 321633 steps, saw 220666 distinct states, run finished after 3004 ms. (steps per millisecond=107 ) properties seen :0
[2024-06-01 07:53:34] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:34] [INFO ] Invariant cache hit.
[2024-06-01 07:53:34] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:35] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:36] [INFO ] Deduced a trap composed of 112 places in 667 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:37] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 3 ms to minimize.
[2024-06-01 07:53:37] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 4 ms to minimize.
[2024-06-01 07:53:37] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 2 ms to minimize.
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:53:38] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1087 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2680 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 4452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 135 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 392/439 places, 2104/2480 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 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 376524 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 1
Probabilistic random walk after 376524 steps, saw 207638 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
[2024-06-01 07:53:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 07:53:42] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 07:53:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:42] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:43] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 4 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 4 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 3 ms to minimize.
[2024-06-01 07:53:44] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 4 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 3 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 3 ms to minimize.
[2024-06-01 07:53:45] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3300ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=77 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 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 316215 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 316215 steps, saw 217230 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-06-01 07:53:49] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 07:53:49] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:50] [INFO ] Deduced a trap composed of 11 places in 508 ms of which 5 ms to minimize.
[2024-06-01 07:53:50] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 2 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 3 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1471 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1086 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2466 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3183ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 80 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 79774 steps, run visited all 1 properties in 618 ms. (steps per millisecond=129 )
Probabilistic random walk after 79774 steps, saw 51497 distinct states, run finished after 622 ms. (steps per millisecond=128 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 216349 steps, run visited all 1 properties in 1923 ms. (steps per millisecond=112 )
Probabilistic random walk after 216349 steps, saw 151963 distinct states, run finished after 1923 ms. (steps per millisecond=112 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348570 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 348570 steps, saw 238336 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-06-01 07:53:58] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
[2024-06-01 07:53:58] [INFO ] Invariant cache hit.
[2024-06-01 07:53:58] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 74 places in 486 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 720/1471 variables, 307/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 534/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1471 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1079 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:59] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:54:00] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/751 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 720/1471 variables, 307/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 534/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:01] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:54:01] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1471 variables, 2/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1471 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1089 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1981 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 2480/2480 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 392 transition count 2104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 392 transition count 2104
Applied a total of 94 rules in 81 ms. Remains 392 /439 variables (removed 47) and now considering 2104/2480 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 392/439 places, 2104/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386667 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386667 steps, saw 212616 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-06-01 07:54:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-06-01 07:54:04] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 07:54:04] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 392/1048 variables, 266/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 247/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:05] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 4 ms to minimize.
[2024-06-01 07:54:06] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 4 ms to minimize.
[2024-06-01 07:54:06] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/656 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 392/1048 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1048 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2003ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 72 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 07:54:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:54:06] [INFO ] Invariant cache hit.
[2024-06-01 07:54:07] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-06-01 07:54:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:54:07] [INFO ] Invariant cache hit.
[2024-06-01 07:54:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 07:54:09] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
[2024-06-01 07:54:10] [INFO ] Redundant transitions in 89 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-06-01 07:54:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-06-01 07:54:10] [INFO ] Invariant cache hit.
[2024-06-01 07:54:10] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 5 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 71 places in 232 ms of which 3 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 124 places in 215 ms of which 3 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 3 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 3 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 3 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 62 places in 269 ms of which 3 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 27 places in 252 ms of which 3 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 3 ms to minimize.
[2024-06-01 07:54:37] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:54:38] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:54:38] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 3 ms to minimize.
[2024-06-01 07:54:38] [INFO ] Deduced a trap composed of 74 places in 317 ms of which 3 ms to minimize.
[2024-06-01 07:54:39] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 3 ms to minimize.
SMT process timed out in 31729ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35109 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 38 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-06-01 07:54:41] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 07:54:41] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 07:54:41] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-01 07:54:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:54:41] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:54:41] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:54:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-06-01 07:54:42] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 07:54:42] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:54:42] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:54:42] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 272 ms.
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 338085 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 338085 steps, saw 231268 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-06-01 07:54:45] [INFO ] Flow matrix only has 1032 transitions (discarded 1448 similar events)
// Phase 1: matrix 1032 rows 439 cols
[2024-06-01 07:54:45] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 07:54:45] [INFO ] State equation strengthened by 613 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 720/1471 variables, 307/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1471 variables, 534/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1471 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 1078 constraints, problems are : Problem set: 0 solved, 1 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 106/290 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 52/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/444 variables, 70/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 25/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/444 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 293/737 variables, 14/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/737 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/751 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/751 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 5 ms to minimize.
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/751 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/751 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 720/1471 variables, 307/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1471 variables, 534/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1471 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 1081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 439/439 constraints, ReadFeed: 613/613 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1966ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13012 steps, including 544 resets, run visited all 1 properties in 70 ms. (steps per millisecond=185 )
Parikh walk visited 1 properties in 71 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 33 ms. (1176 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
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-08"
export BK_EXAMINATION="Liveness"
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-08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r494-smll-171636275100119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;