About the Execution of LTSMin+red for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1344.348 | 1800000.00 | 2386109.00 | 2988.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.r514-smll-171654416900174.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 Peterson-PT-5, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416900174
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K May 18 16:43 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 1717247414112
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:10:17] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2024-06-01 13:10:17] [INFO ] Transformed 834 places.
[2024-06-01 13:10:17] [INFO ] Transformed 1242 transitions.
[2024-06-01 13:10:17] [INFO ] Found NUPN structural information;
[2024-06-01 13:10:17] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 646 ms.
Built sparse matrix representations for Structural reductions in 18 ms.31278KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 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 148 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 181 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 834/834 places, 1242/1242 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 88 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 13:10:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 13:10:17] [INFO ] Computed 23 invariants in 41 ms
[2024-06-01 13:10:18] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-06-01 13:10:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 13:10:18] [INFO ] Invariant cache hit.
[2024-06-01 13:10:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:10:20] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2024-06-01 13:10:20] [INFO ] Redundant transitions in 152 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 13:10:20] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 13:10:20] [INFO ] Invariant cache hit.
[2024-06-01 13:10:20] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30976ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 31067ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33566 ms. Remains : 834/834 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2781 ms (no deadlock found). (steps per millisecond=449 )
Random directed walk for 1250000 steps, including 0 resets, run took 2912 ms (no deadlock found). (steps per millisecond=429 )
[2024-06-01 13:10:56] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 13:10:57] [INFO ] Invariant cache hit.
[2024-06-01 13:10:57] [INFO ] [Real]Absence check using 17 positive place invariants in 55 ms returned sat
[2024-06-01 13:10:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 37 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 143 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2024-06-01 13:10:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2024-06-01 13:10:57] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 13:10:58] [INFO ] Implicit Places using invariants in 529 ms returned [228, 240, 241, 242, 243, 244]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 546 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 701 ms. Remains : 258/834 places, 672/1242 transitions.
Discarding 6 transitions out of 672. Remains 666
RANDOM walk for 40000 steps (8 resets) in 4231 ms. (9 steps per ms) remains 253/666 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 12 ms. (30 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 14 ms. (26 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 253/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 252/253 properties
BEST_FIRST walk for 400 steps (8 resets) in 15 ms. (25 steps per ms) remains 252/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 15 ms. (25 steps per ms) remains 252/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 15 ms. (25 steps per ms) remains 252/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 252/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 252/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 251/252 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 12 ms. (30 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 17 ms. (22 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 251/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 12 ms. (30 steps per ms) remains 250/251 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 13 ms. (28 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 250/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/250 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 9 ms. (40 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 18 ms. (21 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 4 ms. (80 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 249/249 properties
[2024-06-01 13:10:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:10:59] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 13:10:59] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 65/258 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 65/275 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 275 constraints, problems are : Problem set: 0 solved, 249 unsolved in 5030 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 65/258 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 65/275 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 18 places in 371 ms of which 43 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 6 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 5 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 4 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 4 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 5 ms to minimize.
[2024-06-01 13:11:09] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 10375ms, After SMT, problems are : Problem set: 0 solved, 249 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 193 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 28 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 4000000 steps (8 resets) in 74340 ms. (53 steps per ms) remains 228/249 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 228/228 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 228/228 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 227/228 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 227/227 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 227/227 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 223/227 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 221/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 219/221 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 218/219 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 212/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 211/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 209/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 207/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 207/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 207/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 205/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 205/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 203/205 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 202/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 201/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 198/201 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 198/198 properties
[2024-06-01 13:11:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:11:40] [INFO ] Invariant cache hit.
[2024-06-01 13:11:40] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 98/257 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 98/273 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 5 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:11:44] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:11:45] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:11:45] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:11:45] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:11:45] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:11:48] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:11:48] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:11:48] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:11:48] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:11:49] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:11:49] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:11:49] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:11:50] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:11:50] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:11:50] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:11:50] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:11:51] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 4 ms to minimize.
[2024-06-01 13:11:51] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:11:51] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:11:51] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:11:52] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:11:52] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 5 ms to minimize.
[2024-06-01 13:11:52] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:11:53] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:11:53] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:11:53] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:11:54] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 5 ms to minimize.
[2024-06-01 13:11:57] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:11:58] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:11:58] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:11:58] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:11:58] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:11:59] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:11:59] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:11:59] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 4 ms to minimize.
[2024-06-01 13:11:59] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:12:00] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:12:00] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:12:00] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:12:00] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:12:01] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:12:02] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:12:03] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:12:03] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:12:03] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:12:04] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:12:04] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:12:04] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:12:04] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:12:05] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:12:05] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:12:05] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:12:05] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:12:06] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:12:07] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:12:08] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:12:09] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:12:09] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:12:09] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:12:09] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:12:10] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:12:10] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:12:10] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:12:10] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:12:10] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:12:11] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:12:11] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:12:11] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:12:11] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:12:11] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:12:12] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:12:17] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:12:17] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:12:17] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:12:17] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:12:17] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:12:18] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 4 ms to minimize.
[2024-06-01 13:12:18] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:12:18] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 35 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 45099ms, After SMT, problems are : Problem set: 0 solved, 198 unsolved
Fused 198 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 159 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 29 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 4000000 steps (8 resets) in 60431 ms. (66 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 198/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 196/198 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 196/196 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/196 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 192/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 192/192 properties
Interrupted probabilistic random walk after 6565650 steps, run timeout after 54001 ms. (steps per millisecond=121 ) properties seen :0 out of 192
Probabilistic random walk after 6565650 steps, saw 939010 distinct states, run finished after 54009 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 13:13:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:13:37] [INFO ] Invariant cache hit.
[2024-06-01 13:13:37] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 101/257 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 101/273 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:13:41] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 5 ms to minimize.
[2024-06-01 13:13:41] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:13:42] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 4 ms to minimize.
[2024-06-01 13:13:42] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:13:42] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:13:43] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:13:43] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:13:43] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:13:43] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 3 ms to minimize.
[2024-06-01 13:13:44] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:13:44] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:13:44] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:13:44] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:13:45] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:13:46] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:13:47] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:13:47] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:13:48] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:13:48] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:13:48] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:13:48] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 9 ms to minimize.
[2024-06-01 13:13:49] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:13:49] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:13:49] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:13:49] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:13:50] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:13:50] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:13:50] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:13:50] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:13:51] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:13:51] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:13:51] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:13:51] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:13:52] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:13:52] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:13:54] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:13:54] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:13:56] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:13:56] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:13:56] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 5 ms to minimize.
[2024-06-01 13:13:58] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:13:58] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:13:58] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 76 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:13:59] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:00] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:14:01] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:14:01] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:14:01] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:14:01] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:14:02] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:14:02] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:14:02] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:14:02] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:14:03] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 6 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:14:04] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:14:05] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:14:05] [INFO ] Deduced a trap composed of 26 places in 294 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:06] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:14:06] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 5 ms to minimize.
[2024-06-01 13:14:06] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:14:07] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:14:07] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:14:07] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:14:07] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:14:08] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:14:09] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:14:10] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 4 ms to minimize.
[2024-06-01 13:14:10] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:14:10] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:14:10] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:13] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:14:13] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:14:13] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:14:13] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:14:15] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:14:15] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 4 ms to minimize.
[2024-06-01 13:14:15] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:14:15] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:14:15] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:14:16] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:14:16] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:14:16] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:14:16] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:14:16] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
[2024-06-01 13:14:17] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:19] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:14:19] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:14:19] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:14:19] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:14:19] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:14:20] [INFO ] Deduced a trap composed of 17 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:14:20] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:14:20] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:14:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:14:21] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:14:21] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:14:21] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:14:21] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:14:22] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:14:22] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:14:22] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:14:22] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 4 ms to minimize.
[2024-06-01 13:14:23] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:14:23] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:14:23] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:26] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:14:26] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:14:26] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:14:26] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:39] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:14:39] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:14:39] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:14:39] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:14:39] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:14:40] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:14:40] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:14:40] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:14:40] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:14:40] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:14:41] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:14:41] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:14:42] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:14:42] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:14:42] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:14:42] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:14:42] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:14:43] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:14:43] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:14:43] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:47] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 4 ms to minimize.
[2024-06-01 13:14:47] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 4 ms to minimize.
[2024-06-01 13:14:47] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:14:48] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:14:48] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:14:48] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:14:49] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:14:49] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:14:49] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:14:50] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:14:50] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:14:50] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:14:51] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:14:51] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:14:51] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:14:51] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:14:51] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:14:52] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:14:52] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:14:52] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/810 variables, and 473 constraints, problems are : Problem set: 0 solved, 192 unsolved in 75027 ms.
Refiners :[Domain max(s): 257/258 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 200/200 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 101/257 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 101/273 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 200/473 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:14:56] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:14:57] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:14:57] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:14:58] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:14:58] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:14:59] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:14:59] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:15:00] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:15:01] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:15:01] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:15:01] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:15:01] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:15:01] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:15:02] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:15:02] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:15:02] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:15:02] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:15:02] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:15:03] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:15:03] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:15:10] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:15:11] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:15:12] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:15:12] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:15:12] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:15:12] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:15:13] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:15:14] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 8/501 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:15:20] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:15:23] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:15:23] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 3 ms to minimize.
[2024-06-01 13:15:23] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:15:24] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:15:24] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:15:25] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 3 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 5 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:15:38] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:15:38] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:15:38] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 11/520 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:15:45] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:15:46] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:15:47] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:15:47] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:15:48] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:15:56] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:15:57] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:15:59] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:15:59] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:15:59] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:16:00] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 7/532 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/810 variables, and 532 constraints, problems are : Problem set: 0 solved, 192 unsolved in 75013 ms.
Refiners :[Domain max(s): 257/258 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/192 constraints, Known Traps: 259/259 constraints]
After SMT, in 150094ms problems are : Problem set: 0 solved, 192 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 156 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 31 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 4000000 steps (8 resets) in 58971 ms. (67 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 192/192 properties
Interrupted probabilistic random walk after 6045172 steps, run timeout after 57001 ms. (steps per millisecond=106 ) properties seen :0 out of 192
Probabilistic random walk after 6045172 steps, saw 864643 distinct states, run finished after 57003 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 13:17:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:17:24] [INFO ] Invariant cache hit.
[2024-06-01 13:17:24] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 101/257 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 101/273 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:29] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 5 ms to minimize.
[2024-06-01 13:17:29] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:17:29] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:17:30] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:17:30] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:17:30] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:17:30] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:17:31] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:17:31] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:17:31] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:17:32] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:17:32] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:17:32] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:17:32] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:17:33] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:17:33] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:17:33] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:17:34] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:17:34] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:17:34] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:17:35] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:17:36] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:17:37] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:17:38] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:17:39] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:17:40] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:42] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:17:42] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:17:42] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 60 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:17:43] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:17:44] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:17:45] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 76 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:17:46] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:48] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:17:48] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:17:48] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:17:48] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:17:49] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:17:50] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:17:51] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:17:52] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:17:53] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:17:54] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:55] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:17:56] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:17:57] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 5 ms to minimize.
[2024-06-01 13:17:58] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:17:58] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:17:59] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:18:00] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:18:01] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:18:02] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:18:04] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:18:05] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:18:06] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 3 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:18:07] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:18:13] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:18:14] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:18:15] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:18:15] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:18:16] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:18:21] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:18:22] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:18:22] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:18:22] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:18:23] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:18:23] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:18:23] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:18:23] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:18:24] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:18:24] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:18:24] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:18:24] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:18:25] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:18:25] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:18:25] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:18:25] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:18:31] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:18:32] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:18:32] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 4 ms to minimize.
[2024-06-01 13:18:32] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:18:33] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:18:34] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:18:34] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:18:34] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:18:34] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:18:35] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:18:35] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:18:35] [INFO ] Deduced a trap composed of 62 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:18:35] [INFO ] Deduced a trap composed of 59 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:18:36] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:18:36] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:18:36] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:18:37] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:18:37] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:18:37] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:18:38] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:18:48] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:18:49] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:18:51] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 3 ms to minimize.
[2024-06-01 13:18:52] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:18:52] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:18:53] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:18:53] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:18:54] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:18:54] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:18:54] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
SMT process timed out in 90300ms, After SMT, problems are : Problem set: 0 solved, 192 unsolved
Fused 192 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 156 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 27 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 25 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:18:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:18:54] [INFO ] Invariant cache hit.
[2024-06-01 13:18:55] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 13:18:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:18:55] [INFO ] Invariant cache hit.
[2024-06-01 13:18:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:18:55] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-06-01 13:18:55] [INFO ] Redundant transitions in 32 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:18:55] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:18:55] [INFO ] Invariant cache hit.
[2024-06-01 13:18:55] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:19:03] [INFO ] Deduced a trap composed of 12 places in 359 ms of which 5 ms to minimize.
[2024-06-01 13:19:03] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:19:03] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:19:04] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:19:04] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:19:04] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:19:04] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:19:05] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:19:05] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:19:05] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:19:05] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:19:05] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:19:06] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:19:07] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:19:07] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:19:07] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:19:08] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:19:08] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:19:08] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:19:09] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:19:09] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:19:09] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:19:09] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:19:09] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:19:10] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:19:10] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:19:10] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:19:10] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:19:10] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:19:11] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 3 ms to minimize.
[2024-06-01 13:19:18] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:19:19] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:19:20] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:19:21] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:19:22] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:19:23] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:19:23] [INFO ] Deduced a trap composed of 49 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:19:23] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:19:24] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:19:24] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:19:24] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 2 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-06-01 13:19:25] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:19:26] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:19:26] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 30326ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31564 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 400000 steps (8 resets) in 6487 ms. (61 steps per ms) remains 81/156 properties
Running SMT prover for 81 properties.
[2024-06-01 13:19:28] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:19:28] [INFO ] Invariant cache hit.
[2024-06-01 13:19:28] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 13:19:28] [INFO ] After 387ms SMT Verify possible using state equation in real domain returned unsat :0 sat :81
[2024-06-01 13:19:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:19:29] [INFO ] After 417ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :81
TRAPS : Iteration 0
[2024-06-01 13:19:34] [INFO ] After 5554ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:81
[2024-06-01 13:19:34] [INFO ] After 6150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:81
[2024-06-01 13:19:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 13:19:34] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :81
[2024-06-01 13:19:35] [INFO ] After 519ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :81
TRAPS : Iteration 0
[2024-06-01 13:19:35] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:19:36] [INFO ] Deduced a trap composed of 17 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:19:36] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 2 ms to minimize.
[2024-06-01 13:19:36] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:19:36] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:19:37] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 4 ms to minimize.
[2024-06-01 13:19:37] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:19:37] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:19:37] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:19:38] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:19:38] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:19:38] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:19:39] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:19:39] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:19:39] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:19:39] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:19:39] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:19:40] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:19:40] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 4 ms to minimize.
[2024-06-01 13:19:40] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:19:40] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:19:41] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:19:42] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6508 ms
[2024-06-01 13:19:42] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:19:42] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:19:42] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-06-01 13:19:42] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:19:42] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 3 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:19:44] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:19:44] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:19:44] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:19:44] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:19:45] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 4 ms to minimize.
[2024-06-01 13:19:45] [INFO ] Deduced a trap composed of 61 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:19:45] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:19:46] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:19:46] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:19:46] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:19:46] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:19:46] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 41 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:19:47] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5317 ms
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:19:47] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:19:49] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:19:49] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:19:49] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:19:49] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:19:50] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3582 ms
[2024-06-01 13:19:51] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2024-06-01 13:19:51] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-06-01 13:19:52] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-06-01 13:19:52] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:19:52] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:19:53] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:19:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 776 ms
[2024-06-01 13:19:53] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:19:53] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:19:54] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 840 ms
[2024-06-01 13:19:54] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:19:54] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2024-06-01 13:19:54] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-06-01 13:19:55] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:19:55] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:19:55] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:19:55] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:19:56] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:19:56] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:19:56] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:19:56] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:19:57] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:19:57] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:19:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2653 ms
[2024-06-01 13:19:57] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:19:58] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:19:58] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:19:58] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:19:59] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:19:59] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:19:59] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:19:59] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:20:00] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:20:00] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:20:00] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:20:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3049 ms
[2024-06-01 13:20:00] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:20:01] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:20:01] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:20:01] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:20:01] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:20:01] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:20:02] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:20:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1465 ms
[2024-06-01 13:20:02] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:20:02] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:20:03] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:20:03] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:20:03] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:20:03] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:20:03] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:20:04] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:20:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2016 ms
[2024-06-01 13:20:04] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:20:04] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:20:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-06-01 13:20:05] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:20:05] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:20:06] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:20:06] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:20:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1212 ms
[2024-06-01 13:20:06] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:20:07] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:20:07] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:20:07] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:20:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1137 ms
[2024-06-01 13:20:07] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2024-06-01 13:20:08] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2024-06-01 13:20:08] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:20:08] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:20:08] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:20:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2024-06-01 13:20:09] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-06-01 13:20:09] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:20:09] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 4 ms to minimize.
[2024-06-01 13:20:10] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:20:10] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:20:10] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:20:10] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:20:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1466 ms
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:20:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1029 ms
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2024-06-01 13:20:12] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:20:13] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1591 ms
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:20:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2024-06-01 13:20:15] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:20:16] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2024-06-01 13:20:17] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 4 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2024-06-01 13:20:18] [INFO ] Deduced a trap composed of 37 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2024-06-01 13:20:18] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-06-01 13:20:19] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-06-01 13:20:20] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:20:20] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:20:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2024-06-01 13:20:21] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-06-01 13:20:21] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-06-01 13:20:21] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-06-01 13:20:22] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:20:22] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:20:23] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:20:23] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:20:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1245 ms
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2024-06-01 13:20:24] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-06-01 13:20:25] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 4 ms to minimize.
[2024-06-01 13:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-06-01 13:20:25] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 47 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:20:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 598 ms
TRAPS : Iteration 1
[2024-06-01 13:20:26] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-06-01 13:20:27] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2024-06-01 13:20:29] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:20:29] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:20:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2024-06-01 13:20:33] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-06-01 13:20:33] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:20:33] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 6 ms to minimize.
[2024-06-01 13:20:34] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 2 ms to minimize.
[2024-06-01 13:20:34] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:20:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 955 ms
[2024-06-01 13:20:36] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-06-01 13:20:36] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2024-06-01 13:20:36] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2024-06-01 13:20:37] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 733 ms
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-06-01 13:20:38] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
TRAPS : Iteration 2
[2024-06-01 13:20:46] [INFO ] Deduced a trap composed of 33 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2024-06-01 13:20:47] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 3 ms to minimize.
[2024-06-01 13:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-06-01 13:20:47] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
TRAPS : Iteration 3
[2024-06-01 13:20:49] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-06-01 13:20:50] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 4 ms to minimize.
[2024-06-01 13:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-06-01 13:20:57] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 4 ms to minimize.
[2024-06-01 13:20:57] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 526 ms
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 4 ms to minimize.
[2024-06-01 13:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:20:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1070 ms
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
TRAPS : Iteration 4
[2024-06-01 13:21:03] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:21:03] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:21:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2024-06-01 13:21:05] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:21:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-06-01 13:21:06] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
TRAPS : Iteration 5
[2024-06-01 13:21:10] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:21:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2024-06-01 13:21:11] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2024-06-01 13:21:13] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:21:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-06-01 13:21:15] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2024-06-01 13:21:16] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 6 ms to minimize.
[2024-06-01 13:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
TRAPS : Iteration 6
[2024-06-01 13:21:22] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-06-01 13:21:25] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
TRAPS : Iteration 7
[2024-06-01 13:21:30] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-06-01 13:21:32] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:21:32] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:21:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
TRAPS : Iteration 8
[2024-06-01 13:21:38] [INFO ] After 123474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :81
[2024-06-01 13:21:41] [INFO ] After 127249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :81
RANDOM walk for 3867836 steps (8 resets) in 109429 ms. (35 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 192/192 properties
Interrupted probabilistic random walk after 9601795 steps, run timeout after 102001 ms. (steps per millisecond=94 ) properties seen :0 out of 192
Probabilistic random walk after 9601795 steps, saw 1372675 distinct states, run finished after 102002 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 13:23:57] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:23:57] [INFO ] Invariant cache hit.
[2024-06-01 13:23:57] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 101/257 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 101/273 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:24:02] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:24:03] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:24:04] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:24:05] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:24:06] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 3 ms to minimize.
[2024-06-01 13:24:06] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:24:06] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:24:06] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:24:07] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:24:08] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:24:09] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:24:10] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:24:11] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 3 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 3 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:24:12] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2024-06-01 13:24:13] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:24:16] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:24:17] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 20 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:24:18] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:24:19] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:24:19] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:24:19] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:24:20] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:24:20] [INFO ] Deduced a trap composed of 76 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:24:20] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:24:21] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:24:21] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:24:22] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:24:23] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:24:24] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:24:25] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:24:26] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:27] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:24:28] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:24:29] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:24:30] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 4 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:24:31] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:24:32] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:24:35] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:24:36] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 4 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:24:37] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:24:38] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:24:39] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:40] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:24:41] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:24:42] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:24:43] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:24:44] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:24:45] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 2 ms to minimize.
[2024-06-01 13:24:48] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:24:49] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:24:49] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:24:49] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:24:49] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:24:50] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:24:51] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:24:52] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:24:52] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:24:52] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:24:52] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:24:53] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:25:00] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:25:01] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:25:02] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:25:03] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 60 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:25:04] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:25:05] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:25:09] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:25:10] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 4 ms to minimize.
[2024-06-01 13:25:11] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:25:12] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 56 places in 283 ms of which 3 ms to minimize.
[2024-06-01 13:25:13] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:25:14] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:25:20] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:25:21] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:25:22] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:25:22] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:25:23] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 1 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:25:24] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:25:25] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:25:26] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:25:27] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 20/493 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 13:25:36] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 4 ms to minimize.
[2024-06-01 13:25:38] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:25:39] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:25:40] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:25:40] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:25:41] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:25:42] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 4 ms to minimize.
[2024-06-01 13:25:43] [INFO ] Deduced a trap composed of 51 places in 248 ms of which 3 ms to minimize.
SMT process timed out in 105206ms, After SMT, problems are : Problem set: 0 solved, 192 unsolved
Fused 192 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 156 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 27 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 24 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:25:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:25:43] [INFO ] Invariant cache hit.
[2024-06-01 13:25:43] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 13:25:43] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:25:43] [INFO ] Invariant cache hit.
[2024-06-01 13:25:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:25:44] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-06-01 13:25:44] [INFO ] Redundant transitions in 114 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:25:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:25:44] [INFO ] Invariant cache hit.
[2024-06-01 13:25:44] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:25:51] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:25:52] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:25:53] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 4 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:25:54] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:25:55] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:25:56] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:25:57] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:25:58] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:25:59] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:26:00] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:26:01] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:26:02] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:26:08] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:26:09] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:26:10] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:26:11] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:26:12] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:26:12] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:26:13] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:26:14] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30319ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31836 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 400000 steps (8 resets) in 4906 ms. (81 steps per ms) remains 80/156 properties
Running SMT prover for 80 properties.
[2024-06-01 13:26:16] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:26:16] [INFO ] Invariant cache hit.
[2024-06-01 13:26:16] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 13:26:16] [INFO ] After 282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :80
[2024-06-01 13:26:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:26:17] [INFO ] After 279ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :80
TRAPS : Iteration 0
[2024-06-01 13:26:21] [INFO ] After 4991ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:80
[2024-06-01 13:26:21] [INFO ] After 5444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:80
[2024-06-01 13:26:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 13:26:22] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :80
[2024-06-01 13:26:23] [INFO ] After 545ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :80
TRAPS : Iteration 0
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:26:23] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:26:24] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:26:24] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:26:24] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:26:25] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:26:26] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:26:27] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:26:28] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2024-06-01 13:26:29] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:26:30] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:26:31] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:26:32] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9646 ms
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:26:33] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:26:34] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:26:35] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:26:36] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4462 ms
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:26:37] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:26:38] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:26:39] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:26:40] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:26:41] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:26:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5221 ms
[2024-06-01 13:26:42] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:26:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1022 ms
[2024-06-01 13:26:43] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:26:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2024-06-01 13:26:44] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 637 ms
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:26:45] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 887 ms
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:26:46] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:26:47] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:26:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2069 ms
[2024-06-01 13:26:48] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:26:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1126 ms
[2024-06-01 13:26:49] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2024-06-01 13:26:50] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:26:51] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1517 ms
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2024-06-01 13:26:53] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:26:53] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:26:53] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:26:54] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:26:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2024-06-01 13:26:54] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:26:54] [INFO ] Deduced a trap composed of 63 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:26:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2024-06-01 13:26:55] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:26:56] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:26:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2202 ms
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:26:58] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:26:59] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:27:00] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3106 ms
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 540 ms
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:27:02] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:27:03] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 3 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:27:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3026 ms
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:27:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:27:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 799 ms
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 2 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 2 ms to minimize.
[2024-06-01 13:27:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 760 ms
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:27:08] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1492 ms
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:27:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 612 ms
[2024-06-01 13:27:10] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:27:10] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:27:10] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1166 ms
[2024-06-01 13:27:11] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 8 ms to minimize.
[2024-06-01 13:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:27:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 876 ms
[2024-06-01 13:27:14] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-06-01 13:27:14] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 4 ms to minimize.
[2024-06-01 13:27:14] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 888 ms
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:27:15] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:27:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1158 ms
[2024-06-01 13:27:16] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 4 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2024-06-01 13:27:17] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
TRAPS : Iteration 1
[2024-06-01 13:27:18] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:27:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-01 13:27:20] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2024-06-01 13:27:21] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-06-01 13:27:22] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2024-06-01 13:27:25] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:27:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 778 ms
[2024-06-01 13:27:27] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2024-06-01 13:27:27] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-06-01 13:27:28] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-06-01 13:27:29] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2024-06-01 13:27:29] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:27:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 859 ms
[2024-06-01 13:27:31] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:27:32] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:27:32] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:27:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 727 ms
TRAPS : Iteration 2
[2024-06-01 13:27:34] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2024-06-01 13:27:35] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:27:35] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-06-01 13:27:38] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:27:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1002 ms
[2024-06-01 13:27:42] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-06-01 13:27:42] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-06-01 13:27:43] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:27:43] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:27:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2024-06-01 13:27:43] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:27:43] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:27:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
TRAPS : Iteration 3
[2024-06-01 13:27:48] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-06-01 13:27:51] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-06-01 13:27:51] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
TRAPS : Iteration 4
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-06-01 13:27:55] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-06-01 13:28:01] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
TRAPS : Iteration 5
[2024-06-01 13:28:02] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-06-01 13:28:06] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2024-06-01 13:28:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2024-06-01 13:28:09] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:28:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
TRAPS : Iteration 6
[2024-06-01 13:28:13] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:28:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-06-01 13:28:18] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2024-06-01 13:28:19] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:28:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
TRAPS : Iteration 7
[2024-06-01 13:28:22] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-06-01 13:28:24] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-06-01 13:28:27] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
TRAPS : Iteration 8
[2024-06-01 13:28:36] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
TRAPS : Iteration 9
[2024-06-01 13:28:43] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
TRAPS : Iteration 10
[2024-06-01 13:28:55] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:28:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
TRAPS : Iteration 11
[2024-06-01 13:29:01] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-06-01 13:29:02] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
TRAPS : Iteration 12
[2024-06-01 13:29:07] [INFO ] After 165231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :80
[2024-06-01 13:29:10] [INFO ] After 168728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :80
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 70 steps (0 resets) in 5 ms. (11 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 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 57 steps (0 resets) in 5 ms. (9 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 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 14607 steps (3 resets) in 68 ms. (211 steps per ms) remains 0/1 properties
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 30382 steps (7 resets) in 206 ms. (146 steps per ms) remains 0/1 properties
RANDOM walk for 18762 steps (4 resets) in 91 ms. (203 steps per ms) remains 0/1 properties
RANDOM walk for 28384 steps (6 resets) in 167 ms. (168 steps per ms) remains 0/1 properties
RANDOM walk for 21043 steps (4 resets) in 65 ms. (318 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1041082 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1041082 steps, saw 152109 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
[2024-06-01 13:29:14] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:29:14] [INFO ] Invariant cache hit.
[2024-06-01 13:29:14] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:29:14] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:29:15] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1514 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1932ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 31 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 489 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037575 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037575 steps, saw 151689 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-01 13:29:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:29:19] [INFO ] Invariant cache hit.
[2024-06-01 13:29:19] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:29:20] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1462 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:29:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:29:21] [INFO ] Invariant cache hit.
[2024-06-01 13:29:21] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 13:29:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:29:21] [INFO ] Invariant cache hit.
[2024-06-01 13:29:21] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:29:22] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-06-01 13:29:22] [INFO ] Redundant transitions in 5 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:29:22] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:29:22] [INFO ] Invariant cache hit.
[2024-06-01 13:29:22] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:29:27] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 2 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:29:28] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:29:29] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:29:30] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 4 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 3 ms to minimize.
[2024-06-01 13:29:31] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-06-01 13:29:32] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:29:33] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:29:34] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:29:34] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:29:34] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:29:34] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:39] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 3 ms to minimize.
[2024-06-01 13:29:40] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:29:41] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 4 ms to minimize.
[2024-06-01 13:29:42] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:29:43] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:44] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:29:44] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:29:45] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:29:46] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:29:47] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-01 13:29:47] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:48] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:29:48] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:29:48] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:29:49] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:29:49] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:29:49] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 2 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-06-01 13:29:50] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-06-01 13:29:51] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:29:52] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:29:52] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:29:52] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 375 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30034 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 100/375 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:29:56] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:29:57] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:29:58] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 3 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:29:59] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:30:00] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 4 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:30:01] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:30:04] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:30:05] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:30:06] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:30:07] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 1 ms to minimize.
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:30:08] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:30:09] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:30:10] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:30:15] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:30:15] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:30:15] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:30:16] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:30:16] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-01 13:30:16] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 2 ms to minimize.
[2024-06-01 13:30:16] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:30:16] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:30:17] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:30:18] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:30:19] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:30:19] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:30:20] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:30:20] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-01 13:30:21] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:30:22] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:30:22] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/810 variables, and 435 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30028 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 160/160 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61582 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 8 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 61 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:30:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:30:22] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:30:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:30:22] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:30:22] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:30:22] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 144 ms.
RANDOM walk for 23 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 929250 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 929250 steps, saw 136209 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
[2024-06-01 13:30:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:30:25] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 13:30:25] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:30:26] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:30:27] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 5 ms to minimize.
[2024-06-01 13:30:28] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/700 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 110/810 variables, 140/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:30:29] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 3/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/810 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/810 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3429 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 3787ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 19 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 984214 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 984214 steps, saw 143432 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
[2024-06-01 13:30:32] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:30:32] [INFO ] Invariant cache hit.
[2024-06-01 13:30:32] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:30:33] [INFO ] Deduced a trap composed of 38 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 48 places in 319 ms of which 5 ms to minimize.
[2024-06-01 13:30:34] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 5 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 2 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:30:35] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 28 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:30:36] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 13/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:30:37] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3892 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 4258ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:30:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:30:37] [INFO ] Invariant cache hit.
[2024-06-01 13:30:37] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 13:30:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:30:37] [INFO ] Invariant cache hit.
[2024-06-01 13:30:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:30:38] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-06-01 13:30:38] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:30:38] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:30:38] [INFO ] Invariant cache hit.
[2024-06-01 13:30:38] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:30:45] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:30:45] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:30:46] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:30:47] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 3 ms to minimize.
[2024-06-01 13:30:48] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:30:49] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 2 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:30:50] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:30:51] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:30:51] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:30:51] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:30:52] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:30:53] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:30:54] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:30:55] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:30:59] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:31:00] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:31:01] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 2 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:31:02] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:31:03] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:31:04] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:31:05] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:31:06] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:31:07] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:31:08] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 360 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30023 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 85/360 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:31:11] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:31:12] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 1 ms to minimize.
[2024-06-01 13:31:12] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:31:12] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:31:13] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 3 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:31:14] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:31:15] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:17] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 3 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:31:18] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:31:19] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:31:20] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:31:21] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:31:21] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:31:22] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:31:22] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:31:25] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:31:26] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:31:27] [INFO ] Deduced a trap composed of 60 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:31:28] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:31:29] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:31:30] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 3 ms to minimize.
[2024-06-01 13:31:35] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:31:36] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:31:37] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 3 ms to minimize.
[2024-06-01 13:31:37] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:31:38] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 4 ms to minimize.
SMT process timed out in 60302ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61723 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 25 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:31:38] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:31:38] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:31:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:31:38] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:31:38] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:31:38] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 93 ms.
RANDOM walk for 12330 steps (2 resets) in 46 ms. (262 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 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 996492 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :0 out of 1
Probabilistic random walk after 996492 steps, saw 144386 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
[2024-06-01 13:31:42] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:31:42] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 13:31:42] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:31:43] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:31:44] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:31:44] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 3 ms to minimize.
[2024-06-01 13:31:44] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2368 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2763ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 980105 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 1
Probabilistic random walk after 980105 steps, saw 143022 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
[2024-06-01 13:31:47] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:31:47] [INFO ] Invariant cache hit.
[2024-06-01 13:31:47] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:31:48] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 5 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:31:49] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:31:50] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2081 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2507ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:31:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:31:50] [INFO ] Invariant cache hit.
[2024-06-01 13:31:51] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-06-01 13:31:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:31:51] [INFO ] Invariant cache hit.
[2024-06-01 13:31:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:31:52] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
[2024-06-01 13:31:52] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:31:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:31:52] [INFO ] Invariant cache hit.
[2024-06-01 13:31:52] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:31:59] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:32:00] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 4 ms to minimize.
[2024-06-01 13:32:01] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:32:01] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 3 ms to minimize.
[2024-06-01 13:32:01] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:32:02] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:32:03] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:32:04] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2024-06-01 13:32:05] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:32:06] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 3 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:32:07] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:32:08] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:32:09] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:32:16] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 4 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:32:17] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 2 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:32:18] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 4 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:32:19] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:32:20] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:32:21] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:32:22] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30331ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32325 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 2 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 29 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:32:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:32:22] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:32:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:32:22] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:32:22] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:32:22] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 104 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 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1053437 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1053437 steps, saw 153771 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-06-01 13:32:26] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:32:26] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 13:32:26] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 4 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 4 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:32:27] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 4 ms to minimize.
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:32:28] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:32:29] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:32:29] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:32:29] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:32:30] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3791 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4122ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 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 836269 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836269 steps, saw 122629 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-06-01 13:32:33] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:32:33] [INFO ] Invariant cache hit.
[2024-06-01 13:32:33] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:32:34] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 4 ms to minimize.
[2024-06-01 13:32:35] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 4 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 4 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 4 ms to minimize.
[2024-06-01 13:32:36] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 5 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:32:37] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 13/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:32:38] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/700 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 110/810 variables, 140/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5430 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 5873ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:32:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:32:39] [INFO ] Invariant cache hit.
[2024-06-01 13:32:39] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-06-01 13:32:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:32:39] [INFO ] Invariant cache hit.
[2024-06-01 13:32:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:32:41] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2024-06-01 13:32:41] [INFO ] Redundant transitions in 5 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:32:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:32:41] [INFO ] Invariant cache hit.
[2024-06-01 13:32:41] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:32:47] [INFO ] Deduced a trap composed of 12 places in 334 ms of which 4 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:32:48] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:32:49] [INFO ] Deduced a trap composed of 9 places in 360 ms of which 4 ms to minimize.
[2024-06-01 13:32:49] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:32:49] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:32:50] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:32:51] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:32:52] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:32:53] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 4 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:32:54] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:32:55] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:32:56] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:32:57] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:32:58] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:33:03] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 3 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:33:04] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:33:05] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:06] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:33:06] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:33:06] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:33:06] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:33:07] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:33:08] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:09] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:33:09] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:33:09] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:33:10] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:33:11] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 367 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30016 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 92/367 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:33:14] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:33:15] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:33:16] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:33:18] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:33:19] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:33:20] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:33:21] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:33:22] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:25] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:33:26] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 13:33:27] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:33:28] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:33:29] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:33:30] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:33:30] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:33:36] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 4 ms to minimize.
[2024-06-01 13:33:36] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:33:37] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-01 13:33:37] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:33:39] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/810 variables, and 432 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30022 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 157/157 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62147 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 20 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:33:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:33:41] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:33:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:33:41] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:33:41] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:33:41] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 81 ms.
RANDOM walk for 33928 steps (7 resets) in 114 ms. (295 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 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 970144 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970144 steps, saw 141942 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2024-06-01 13:33:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:33:44] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 13:33:44] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:33:45] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 4 ms to minimize.
[2024-06-01 13:33:45] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:33:46] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 747 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2208 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 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
Interrupted probabilistic random walk after 978306 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :0 out of 1
Probabilistic random walk after 978306 steps, saw 142864 distinct states, run finished after 3001 ms. (steps per millisecond=325 ) properties seen :0
[2024-06-01 13:33:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:33:50] [INFO ] Invariant cache hit.
[2024-06-01 13:33:50] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:33:50] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:33:51] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:33:51] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:33:51] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:33:52] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:33:52] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:33:52] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2384 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2767ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:33:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:33:52] [INFO ] Invariant cache hit.
[2024-06-01 13:33:53] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 13:33:53] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:33:53] [INFO ] Invariant cache hit.
[2024-06-01 13:33:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:33:54] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2024-06-01 13:33:54] [INFO ] Redundant transitions in 9 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:33:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:33:54] [INFO ] Invariant cache hit.
[2024-06-01 13:33:54] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:34:01] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:34:02] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:34:03] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:34:04] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 4 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:34:05] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:06] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:34:06] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:34:06] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:34:07] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:34:07] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:34:07] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:34:08] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 4 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:34:09] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:34:10] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:34:10] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:15] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:34:15] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:34:15] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 6 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:34:16] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-06-01 13:34:17] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 13:34:18] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:34:19] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 2 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:34:20] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:34:21] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:34:22] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:34:24] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 360 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30018 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 85/360 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:28] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:34:28] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:34:28] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:34:28] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:34:29] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:34:29] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:34:29] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:34:29] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 4 ms to minimize.
[2024-06-01 13:34:30] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:34:30] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:34:30] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:34:31] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:34:32] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:34:32] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:34:32] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:34] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:34:34] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:34:35] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:34:36] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:34:37] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:34:40] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:34:41] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 60 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:34:42] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 3 ms to minimize.
[2024-06-01 13:34:43] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-06-01 13:34:44] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:34:49] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:34:50] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 3 ms to minimize.
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:34:51] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-01 13:34:52] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:34:53] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:34:53] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:34:53] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 2 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:34:54] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/810 variables, and 440 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30022 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/258 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 165/165 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62421 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 1 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 23 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:34:55] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:34:55] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:34:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:34:55] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:34:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:34:55] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 79 ms.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 992145 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :0 out of 1
Probabilistic random walk after 992145 steps, saw 143864 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
[2024-06-01 13:34:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:34:58] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 13:34:58] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:34:59] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:34:59] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:34:59] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-06-01 13:34:59] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:34:59] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 4 ms to minimize.
[2024-06-01 13:35:00] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 4 ms to minimize.
[2024-06-01 13:35:00] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 3 ms to minimize.
[2024-06-01 13:35:00] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:35:01] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 748 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2448 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 2809ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 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 932512 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :0 out of 1
Probabilistic random walk after 932512 steps, saw 136562 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
[2024-06-01 13:35:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:04] [INFO ] Invariant cache hit.
[2024-06-01 13:35:04] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-01 13:35:05] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:35:06] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:35:07] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:35:07] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 4 ms to minimize.
[2024-06-01 13:35:07] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 3 ms to minimize.
[2024-06-01 13:35:08] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3815 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:35:08] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:08] [INFO ] Invariant cache hit.
[2024-06-01 13:35:09] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-06-01 13:35:09] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:09] [INFO ] Invariant cache hit.
[2024-06-01 13:35:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:35:10] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2024-06-01 13:35:10] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:35:10] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:10] [INFO ] Invariant cache hit.
[2024-06-01 13:35:10] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:35:17] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:35:17] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:35:17] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 3 ms to minimize.
[2024-06-01 13:35:17] [INFO ] Deduced a trap composed of 28 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:35:18] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:35:18] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:35:18] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-01 13:35:19] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:35:21] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:35:22] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 5 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:35:24] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2024-06-01 13:35:25] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:35:26] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:35:32] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:35:32] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 4 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:35:34] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:35:35] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:35:36] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:35:36] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:35:36] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:35:37] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 4 ms to minimize.
[2024-06-01 13:35:37] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:35:38] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-06-01 13:35:38] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:35:38] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 2 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:35:39] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:35:40] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:35:41] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30386ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32503 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 3 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 24 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:35:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:35:41] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:35:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:35:41] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:35:41] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:35:41] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 98 ms.
RANDOM walk for 28236 steps (6 resets) in 113 ms. (247 steps per ms) remains 0/1 properties
RANDOM walk for 23477 steps (5 resets) in 88 ms. (263 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 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 1035489 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1035489 steps, saw 150741 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-01 13:35:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:35:44] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 13:35:44] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 4 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 5 ms to minimize.
[2024-06-01 13:35:45] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 4 ms to minimize.
[2024-06-01 13:35:46] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:35:47] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 748 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3293 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 3643ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 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 986769 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 1
Probabilistic random walk after 986769 steps, saw 143686 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2024-06-01 13:35:51] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:51] [INFO ] Invariant cache hit.
[2024-06-01 13:35:51] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 4 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 4 ms to minimize.
[2024-06-01 13:35:52] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 4 ms to minimize.
[2024-06-01 13:35:53] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:35:54] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2772 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 16 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:35:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:54] [INFO ] Invariant cache hit.
[2024-06-01 13:35:54] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-06-01 13:35:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:54] [INFO ] Invariant cache hit.
[2024-06-01 13:35:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:35:56] [INFO ] Implicit Places using invariants and state equation in 1392 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-06-01 13:35:56] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:35:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:35:56] [INFO ] Invariant cache hit.
[2024-06-01 13:35:56] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 4 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:36:03] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:36:04] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:36:05] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:36:07] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 4 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:08] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 4 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:36:09] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:36:10] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:36:10] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:36:10] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 4 ms to minimize.
[2024-06-01 13:36:11] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:36:12] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:36:13] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:19] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 3 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 4 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:36:20] [INFO ] Deduced a trap composed of 56 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:36:22] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 4 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 4 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:36:26] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:36:26] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 2 ms to minimize.
[2024-06-01 13:36:26] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 30271ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32302 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:36:26] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:36:26] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:36:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:36:26] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:36:26] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:36:26] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 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 1010478 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :0 out of 1
Probabilistic random walk after 1010478 steps, saw 147704 distinct states, run finished after 3004 ms. (steps per millisecond=336 ) properties seen :0
[2024-06-01 13:36:29] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:36:29] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 13:36:29] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:36:30] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 4 ms to minimize.
[2024-06-01 13:36:30] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:36:31] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 3 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:36:32] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 4 ms to minimize.
[2024-06-01 13:36:33] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:36:33] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3653 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 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
Interrupted probabilistic random walk after 1029819 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1029819 steps, saw 149786 distinct states, run finished after 3003 ms. (steps per millisecond=342 ) properties seen :0
[2024-06-01 13:36:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:36:36] [INFO ] Invariant cache hit.
[2024-06-01 13:36:36] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:36:37] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:36:38] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:36:38] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:36:38] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:36:39] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:36:39] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2267 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2731ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:36:39] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:36:39] [INFO ] Invariant cache hit.
[2024-06-01 13:36:40] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 13:36:40] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:36:40] [INFO ] Invariant cache hit.
[2024-06-01 13:36:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:36:41] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2024-06-01 13:36:41] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:36:41] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:36:41] [INFO ] Invariant cache hit.
[2024-06-01 13:36:41] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:48] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 5 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:36:49] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 3 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:36:50] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:36:52] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 3 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:36:54] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:36:55] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 4 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:36:57] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:36:58] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 3 ms to minimize.
[2024-06-01 13:37:05] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:07] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 3 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-01 13:37:08] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:37:11] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 30399ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32372 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 2 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 21 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:37:12] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:37:12] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:37:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:37:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:37:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:37:12] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 72 ms.
RANDOM walk for 25267 steps (5 resets) in 73 ms. (341 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 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 1017009 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1017009 steps, saw 148625 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-06-01 13:37:15] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:37:15] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 13:37:15] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:15] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 4 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 4 ms to minimize.
[2024-06-01 13:37:16] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 747 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2784 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3135ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 258/258 places, 672/672 transitions.
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 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1030099 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1030099 steps, saw 149786 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-01 13:37:21] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:37:21] [INFO ] Invariant cache hit.
[2024-06-01 13:37:21] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:37:22] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 3 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 3 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 3 ms to minimize.
[2024-06-01 13:37:23] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 6/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1952 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 2370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:37:23] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:37:23] [INFO ] Invariant cache hit.
[2024-06-01 13:37:24] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-06-01 13:37:24] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:37:24] [INFO ] Invariant cache hit.
[2024-06-01 13:37:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:37:25] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
[2024-06-01 13:37:25] [INFO ] Redundant transitions in 9 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:37:25] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:37:25] [INFO ] Invariant cache hit.
[2024-06-01 13:37:25] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:32] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:37:34] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 4 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:37:35] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 3 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:37:36] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 4 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 4 ms to minimize.
[2024-06-01 13:37:37] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:37:38] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 4 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-01 13:37:39] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:37:40] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:37:40] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:37:40] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 4 ms to minimize.
[2024-06-01 13:37:40] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:37:41] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 13:37:42] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-06-01 13:37:43] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 3 ms to minimize.
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 4 ms to minimize.
[2024-06-01 13:37:49] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 3 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 3 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 3 ms to minimize.
[2024-06-01 13:37:54] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-06-01 13:37:55] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:37:56] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
SMT process timed out in 30344ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32369 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 1 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 19 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:37:56] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:37:56] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:37:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:37:56] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:37:56] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:37:56] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 85 ms.
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 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
Interrupted probabilistic random walk after 936719 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936719 steps, saw 137088 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-06-01 13:37:59] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:37:59] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 13:37:59] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-06-01 13:38:00] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:38:01] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1591 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36760 steps (8 resets) in 35 ms. (1021 steps per ms) remains 0/1 properties
RANDOM walk for 27416 steps (6 resets) in 66 ms. (409 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 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
Interrupted probabilistic random walk after 1022854 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1022854 steps, saw 149215 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2024-06-01 13:38:04] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:04] [INFO ] Invariant cache hit.
[2024-06-01 13:38:04] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:05] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:38:05] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 4 ms to minimize.
[2024-06-01 13:38:06] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:38:06] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:38:06] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:38:07] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:38:07] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 5 ms to minimize.
[2024-06-01 13:38:07] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 12/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4361 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 4818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 981806 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 981806 steps, saw 143188 distinct states, run finished after 3004 ms. (steps per millisecond=326 ) properties seen :0
[2024-06-01 13:38:12] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:12] [INFO ] Invariant cache hit.
[2024-06-01 13:38:12] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:38:13] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 4 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 4 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 3 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 5 ms to minimize.
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 4 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 34 places in 318 ms of which 4 ms to minimize.
[2024-06-01 13:38:15] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 4 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:38:16] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 12/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4341 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 4830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:38:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:17] [INFO ] Invariant cache hit.
[2024-06-01 13:38:17] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-06-01 13:38:17] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:17] [INFO ] Invariant cache hit.
[2024-06-01 13:38:18] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:38:19] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2024-06-01 13:38:19] [INFO ] Redundant transitions in 9 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:38:19] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:19] [INFO ] Invariant cache hit.
[2024-06-01 13:38:19] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:38:26] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 5 ms to minimize.
[2024-06-01 13:38:26] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 5 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 4 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 5 ms to minimize.
[2024-06-01 13:38:27] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 3 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 4 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:38:28] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 4 ms to minimize.
[2024-06-01 13:38:29] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 3 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:38:30] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 4 ms to minimize.
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:38:31] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:38:32] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 4 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 3 ms to minimize.
[2024-06-01 13:38:33] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 4 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:38:34] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 3 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:38:35] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-06-01 13:38:36] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 3 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 4 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 4 ms to minimize.
[2024-06-01 13:38:43] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 4 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:38:44] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 2 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 3 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:38:46] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 4 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:38:48] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-06-01 13:38:49] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 30353ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32444 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 5 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 24 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:38:49] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:38:49] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:38:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 13:38:49] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:38:49] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:38:49] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 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
Interrupted probabilistic random walk after 994812 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 994812 steps, saw 144170 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
[2024-06-01 13:38:52] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:38:52] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 13:38:52] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:38:53] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 4 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 3 ms to minimize.
[2024-06-01 13:38:54] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 744 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1880 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 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 949879 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 949879 steps, saw 138778 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
[2024-06-01 13:38:58] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:38:58] [INFO ] Invariant cache hit.
[2024-06-01 13:38:58] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 44 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:38:59] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 4 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 10/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3314 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3826ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:39:01] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:01] [INFO ] Invariant cache hit.
[2024-06-01 13:39:02] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-06-01 13:39:02] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:02] [INFO ] Invariant cache hit.
[2024-06-01 13:39:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:39:03] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-06-01 13:39:03] [INFO ] Redundant transitions in 9 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:39:03] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:03] [INFO ] Invariant cache hit.
[2024-06-01 13:39:03] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 4 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 4 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 4 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 3 ms to minimize.
[2024-06-01 13:39:12] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:39:13] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 4 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 4 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 4 ms to minimize.
[2024-06-01 13:39:14] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 4 ms to minimize.
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 4 ms to minimize.
[2024-06-01 13:39:15] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 4 ms to minimize.
[2024-06-01 13:39:16] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 4 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:39:17] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:39:18] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 4 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 3 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:39:20] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:39:28] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:39:29] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 4 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 4 ms to minimize.
[2024-06-01 13:39:30] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:39:31] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 2 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:39:33] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:39:34] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30316ms, After SMT, problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 30326ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32311 ms. Remains : 258/258 places, 672/672 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 507 edges and 258 vertex of which 177 / 258 are part of one of the 30 SCC in 0 ms
Free SCC test removed 147 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 443 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 111 transition count 200
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 82 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 63 place count 80 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 80 transition count 196
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 68 transition count 190
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 62 transition count 184
Graph (trivial) has 31 edges and 62 vertex of which 31 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 25 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 32 transition count 184
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 157 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 125 output transitions
Drop transitions (Output transitions of discarded places.) removed 125 transitions
Iterating post reduction 1 with 33 rules applied. Total rules applied 134 place count 2 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 159 place count 2 transition count 2
Applied a total of 159 rules in 12 ms. Remains 2 /258 variables (removed 256) and now considering 2/672 (removed 670) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:39:34] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:39:34] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:39:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 13:39:34] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:39:34] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:39:34] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
RANDOM walk for 33722 steps (7 resets) in 163 ms. (205 steps per ms) remains 0/1 properties
RANDOM walk for 28056 steps (6 resets) in 108 ms. (257 steps per ms) remains 0/1 properties
RANDOM walk for 10495 steps (2 resets) in 41 ms. (249 steps per ms) remains 0/1 properties
RANDOM walk for 32104 steps (6 resets) in 118 ms. (269 steps per ms) remains 0/1 properties
RANDOM walk for 27928 steps (6 resets) in 98 ms. (282 steps per ms) remains 0/1 properties
RANDOM walk for 34090 steps (7 resets) in 143 ms. (236 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 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 917847 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 1
Probabilistic random walk after 917847 steps, saw 133619 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
[2024-06-01 13:39:37] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2024-06-01 13:39:37] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 13:39:37] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 155/285 variables, 30/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 200/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 155/285 variables, 30/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 200/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:38] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 4 ms to minimize.
[2024-06-01 13:39:38] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:38] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 56 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 4 ms to minimize.
[2024-06-01 13:39:39] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:39:40] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 9/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 4 ms to minimize.
[2024-06-01 13:39:41] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/700 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 110/810 variables, 140/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/810 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3537 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3867ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 488 steps, including 93 resets, run visited all 1 properties in 3 ms. (steps per millisecond=162 )
Parikh walk visited 1 properties in 13 ms.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 21 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 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 888748 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 1
Probabilistic random walk after 888748 steps, saw 130422 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
[2024-06-01 13:39:44] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:44] [INFO ] Invariant cache hit.
[2024-06-01 13:39:44] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:45] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 4 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 4 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 4 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:39:46] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 4 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2024-06-01 13:39:47] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2583 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3070ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 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 1022308 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1022308 steps, saw 149155 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2024-06-01 13:39:50] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:50] [INFO ] Invariant cache hit.
[2024-06-01 13:39:50] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/700 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/700 variables, 5/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 110/810 variables, 140/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/810 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 738 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 36/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/130 variables, 38/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 195/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/695 variables, 5/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/695 variables, 135/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:51] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 4 ms to minimize.
[2024-06-01 13:39:52] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 4 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 5 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 4 ms to minimize.
[2024-06-01 13:39:53] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/695 variables, 7/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/700 variables, 5/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/700 variables, 5/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/700 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/810 variables, 140/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/810 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 746 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2760 ms.
Refiners :[Domain max(s): 258/258 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 258/258 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 3240ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 258/258 places, 672/672 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 672/672 transitions.
Applied a total of 0 rules in 12 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
[2024-06-01 13:39:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:54] [INFO ] Invariant cache hit.
[2024-06-01 13:39:54] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-06-01 13:39:54] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:54] [INFO ] Invariant cache hit.
[2024-06-01 13:39:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 13:39:55] [INFO ] Implicit Places using invariants and state equation in 1438 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-06-01 13:39:56] [INFO ] Redundant transitions in 8 ms returned []
Running 666 sub problems to find dead transitions.
[2024-06-01 13:39:56] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
[2024-06-01 13:39:56] [INFO ] Invariant cache hit.
[2024-06-01 13:39:56] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:40:02] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 5 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 4 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 3 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 4 ms to minimize.
[2024-06-01 13:40:03] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 4 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:40:04] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 3 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 4 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 3 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 3 ms to minimize.
[2024-06-01 13:40:05] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 3 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2024-06-01 13:40:06] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 3 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 3 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 3 ms to minimize.
[2024-06-01 13:40:07] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:40:08] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 4 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 4 ms to minimize.
[2024-06-01 13:40:09] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 4 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 3 ms to minimize.
[2024-06-01 13:40:10] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 4 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 3 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
[2024-06-01 13:40:11] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:40:12] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="Peterson-PT-5"
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 Peterson-PT-5, 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 r514-smll-171654416900174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 ;