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 |
| 798.792 | 554213.00 | 633136.00 | 1366.40 | 6 6 6 6 5 6 6 1 1 1 1 1 1 1 1 1 | normal |
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.r512-smll-171654407300277.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 UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300277
=====================================================================
--------------------
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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717273333320
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 20:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:22:15] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-06-01 20:22:15] [INFO ] Transformed 834 places.
[2024-06-01 20:22:15] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:22:15] [INFO ] Found NUPN structural information;
[2024-06-01 20:22:15] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA Peterson-PT-5-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 6, 0, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 20:22:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:22:15] [INFO ] Computed 23 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 110 ms. (90 steps per ms)
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 133 ms. (447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 5, 6, 1, 0, 0] Max Struct:[30, 30, 150, 6, 1, 1]
[2024-06-01 20:22:15] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:22:15] [INFO ] Invariant cache hit.
[2024-06-01 20:22:16] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned unsat
[2024-06-01 20:22:17] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2024-06-01 20:22:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 20:22:17] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-06-01 20:22:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:22:17] [INFO ] [Real]Added 205 Read/Feed constraints in 90 ms returned sat
[2024-06-01 20:22:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 37 ms returned sat
[2024-06-01 20:22:18] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-01 20:22:18] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2024-06-01 20:22:19] [INFO ] [Nat]Added 205 Read/Feed constraints in 225 ms returned sat
[2024-06-01 20:22:19] [INFO ] Deduced a trap composed of 32 places in 582 ms of which 72 ms to minimize.
[2024-06-01 20:22:20] [INFO ] Deduced a trap composed of 26 places in 698 ms of which 7 ms to minimize.
[2024-06-01 20:22:21] [INFO ] Deduced a trap composed of 11 places in 635 ms of which 8 ms to minimize.
[2024-06-01 20:22:21] [INFO ] Deduced a trap composed of 15 places in 611 ms of which 7 ms to minimize.
[2024-06-01 20:22:22] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 7 ms to minimize.
[2024-06-01 20:22:23] [INFO ] Deduced a trap composed of 15 places in 579 ms of which 7 ms to minimize.
[2024-06-01 20:22:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 20:22:23] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned unsat
[2024-06-01 20:22:23] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-06-01 20:22:23] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:22:24] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-06-01 20:22:24] [INFO ] [Real]Added 205 Read/Feed constraints in 51 ms returned sat
[2024-06-01 20:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2024-06-01 20:22:24] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:24] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-06-01 20:22:25] [INFO ] [Nat]Added 205 Read/Feed constraints in 233 ms returned sat
[2024-06-01 20:22:25] [INFO ] Deduced a trap composed of 11 places in 608 ms of which 6 ms to minimize.
[2024-06-01 20:22:26] [INFO ] Deduced a trap composed of 37 places in 534 ms of which 7 ms to minimize.
[2024-06-01 20:22:27] [INFO ] Deduced a trap composed of 69 places in 572 ms of which 7 ms to minimize.
[2024-06-01 20:22:27] [INFO ] Deduced a trap composed of 22 places in 565 ms of which 7 ms to minimize.
[2024-06-01 20:22:28] [INFO ] Deduced a trap composed of 11 places in 607 ms of which 9 ms to minimize.
[2024-06-01 20:22:28] [INFO ] Deduced a trap composed of 47 places in 533 ms of which 6 ms to minimize.
[2024-06-01 20:22:29] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 7 ms to minimize.
[2024-06-01 20:22:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 20:22:29] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2024-06-01 20:22:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:30] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-06-01 20:22:30] [INFO ] [Real]Added 205 Read/Feed constraints in 32 ms returned sat
[2024-06-01 20:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2024-06-01 20:22:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2024-06-01 20:22:31] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-06-01 20:22:31] [INFO ] [Nat]Added 205 Read/Feed constraints in 34 ms returned sat
[2024-06-01 20:22:31] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 108 ms.
[2024-06-01 20:22:35] [INFO ] Deduced a trap composed of 116 places in 574 ms of which 7 ms to minimize.
[2024-06-01 20:22:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 20:22:36] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2024-06-01 20:22:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:36] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-06-01 20:22:36] [INFO ] [Real]Added 205 Read/Feed constraints in 28 ms returned sat
[2024-06-01 20:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2024-06-01 20:22:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:37] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-06-01 20:22:37] [INFO ] [Nat]Added 205 Read/Feed constraints in 28 ms returned sat
[2024-06-01 20:22:37] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 91 ms.
[2024-06-01 20:22:37] [INFO ] Added : 18 causal constraints over 4 iterations in 440 ms. Result :sat
Minimization took 599 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 5, 6, 1, 0, 0] Max Struct:[6, 30, 6, 6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 1, 0, 0] Max Struct:[30, 6, 1, 1]
Support contains 38 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 834 transition count 890
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 482 transition count 890
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 704 place count 482 transition count 735
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 1014 place count 327 transition count 735
Applied a total of 1014 rules in 164 ms. Remains 327 /834 variables (removed 507) and now considering 735/1242 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 327/834 places, 735/1242 transitions.
[2024-06-01 20:22:38] [INFO ] Flow matrix only has 615 transitions (discarded 120 similar events)
// Phase 1: matrix 615 rows 327 cols
[2024-06-01 20:22:38] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 1, 0, 0] Max Struct:[30, 6, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2362 ms. (423 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 3140 ms. (1273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1, 0, 0] Max Struct:[30, 6, 1, 1]
[2024-06-01 20:22:44] [INFO ] Flow matrix only has 615 transitions (discarded 120 similar events)
[2024-06-01 20:22:44] [INFO ] Invariant cache hit.
[2024-06-01 20:22:44] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:22:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:44] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-01 20:22:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:22:44] [INFO ] [Real]Added 205 Read/Feed constraints in 50 ms returned sat
[2024-06-01 20:22:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 20:22:44] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:22:44] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-06-01 20:22:45] [INFO ] [Nat]Added 205 Read/Feed constraints in 64 ms returned sat
[2024-06-01 20:22:45] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:22:45] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:22:45] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:22:45] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:22:46] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 4 ms to minimize.
[2024-06-01 20:22:46] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:22:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1299 ms
[2024-06-01 20:22:46] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:22:46] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:22:46] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-06-01 20:22:46] [INFO ] [Real]Added 205 Read/Feed constraints in 27 ms returned sat
[2024-06-01 20:22:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:22:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:22:46] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:22:47] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-06-01 20:22:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 65 ms returned sat
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:22:47] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:22:48] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:22:48] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:22:48] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:22:48] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:22:49] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:22:49] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:22:49] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:22:49] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:22:50] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:22:50] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:22:50] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 8 ms to minimize.
[2024-06-01 20:22:50] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:22:51] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:22:52] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:22:52] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:22:52] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:22:53] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:22:53] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:22:53] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:22:53] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:22:53] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:22:54] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:22:55] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:22:55] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 4 ms to minimize.
[2024-06-01 20:22:55] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:22:55] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:22:56] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:22:57] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:22:57] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:22:58] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:23:01] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:23:01] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:23:03] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:23:04] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:23:05] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:23:06] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:23:07] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:23:07] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:23:07] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:23:08] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:23:09] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:23:09] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:23:09] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:23:11] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:23:11] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:23:12] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:23:14] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:23:14] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:23:14] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:23:14] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:23:14] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:23:15] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:23:16] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:23:17] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:23:17] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:23:18] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:23:18] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:23:18] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:23:19] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:23:19] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:23:19] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:23:19] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:23:20] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-06-01 20:23:22] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 3 ms to minimize.
[2024-06-01 20:23:23] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:23:25] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:23:26] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:23:26] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 2 ms to minimize.
[2024-06-01 20:23:26] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:23:26] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:23:27] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:23:27] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:23:29] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:23:30] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:23:31] [INFO ] Trap strengthening (SAT) tested/added 113/113 trap constraints in 44615 ms
[2024-06-01 20:23:31] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:23:31] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:23:32] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-06-01 20:23:32] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2024-06-01 20:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:23:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:23:32] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:23:32] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-01 20:23:32] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2024-06-01 20:23:32] [INFO ] Computed and/alt/rep : 549/1485/549 causal constraints (skipped 60 transitions) in 55 ms.
[2024-06-01 20:23:33] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:23:33] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:23:33] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:23:34] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 896 ms
[2024-06-01 20:23:34] [INFO ] Added : 95 causal constraints over 20 iterations in 1778 ms. Result :sat
Minimization took 156 ms.
[2024-06-01 20:23:34] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 20:23:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:23:34] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-06-01 20:23:34] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2024-06-01 20:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:23:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:23:34] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 20:23:35] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-06-01 20:23:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 27 ms returned sat
[2024-06-01 20:23:35] [INFO ] Computed and/alt/rep : 549/1485/549 causal constraints (skipped 60 transitions) in 58 ms.
[2024-06-01 20:23:35] [INFO ] Added : 5 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1, 0, 0] Max Struct:[5, 6, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 735/735 transitions.
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 25 Pre rules applied. Total rules applied 0 place count 327 transition count 710
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 302 transition count 710
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 0 with 60 rules applied. Total rules applied 110 place count 272 transition count 680
Applied a total of 110 rules in 58 ms. Remains 272 /327 variables (removed 55) and now considering 680/735 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 272/327 places, 680/735 transitions.
[2024-06-01 20:23:35] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 272 cols
[2024-06-01 20:23:35] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1902 ms. (525 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1304 ms. (1532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2024-06-01 20:23:39] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:23:39] [INFO ] Invariant cache hit.
[2024-06-01 20:23:39] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 20:23:39] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2024-06-01 20:23:39] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-06-01 20:23:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:23:39] [INFO ] [Real]Added 205 Read/Feed constraints in 27 ms returned sat
[2024-06-01 20:23:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:23:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 20:23:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:23:39] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-01 20:23:39] [INFO ] [Nat]Added 205 Read/Feed constraints in 49 ms returned sat
[2024-06-01 20:23:39] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:23:40] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 2 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:23:41] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:23:42] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:23:42] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:23:42] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:23:42] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 2 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:23:43] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:23:44] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:23:45] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-06-01 20:23:45] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:23:45] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:23:45] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:23:45] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:23:46] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:23:46] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:23:47] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:23:48] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:23:48] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:23:48] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:23:48] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:23:49] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:23:50] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:23:50] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:23:50] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:23:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:23:52] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:23:53] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:23:53] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:23:53] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:23:53] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:23:53] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:23:54] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:23:55] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:23:55] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:23:56] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 4 ms to minimize.
[2024-06-01 20:23:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:23:56] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:23:56] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:23:56] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:23:57] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:23:57] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:23:57] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:23:57] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:23:57] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:23:58] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:23:58] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:23:58] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:23:58] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:23:58] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:24:00] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:24:00] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:24:01] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:24:01] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 4 ms to minimize.
[2024-06-01 20:24:01] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:24:01] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:24:02] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:24:02] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:24:03] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:24:07] [INFO ] Trap strengthening (SAT) tested/added 100/100 trap constraints in 28253 ms
[2024-06-01 20:24:08] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Real]Added 205 Read/Feed constraints in 25 ms returned sat
[2024-06-01 20:24:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:24:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 20:24:08] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2024-06-01 20:24:08] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 54 ms.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:24:09] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:24:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1143 ms
[2024-06-01 20:24:10] [INFO ] Added : 72 causal constraints over 16 iterations in 1815 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[6, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 24 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 272/272 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 680/680 transitions.
Applied a total of 0 rules in 23 ms. Remains 272 /272 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-06-01 20:24:10] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:24:10] [INFO ] Invariant cache hit.
[2024-06-01 20:24:11] [INFO ] Implicit Places using invariants in 343 ms returned [231, 243, 244, 245, 246, 247]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 347 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 266/272 places, 680/680 transitions.
Applied a total of 0 rules in 18 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 392 ms. Remains : 266/272 places, 680/680 transitions.
[2024-06-01 20:24:11] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2024-06-01 20:24:11] [INFO ] Computed 17 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[6, 1]
RANDOM walk for 1000000 steps (2 resets) in 1842 ms. (542 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1271 ms. (1572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[6, 1]
[2024-06-01 20:24:14] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:24:14] [INFO ] Invariant cache hit.
[2024-06-01 20:24:14] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-06-01 20:24:14] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-01 20:24:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:24:14] [INFO ] [Real]Added 205 Read/Feed constraints in 34 ms returned sat
[2024-06-01 20:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:24:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 20:24:15] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2024-06-01 20:24:15] [INFO ] [Nat]Added 205 Read/Feed constraints in 63 ms returned sat
[2024-06-01 20:24:15] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:24:15] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:24:15] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:24:16] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 5 ms to minimize.
[2024-06-01 20:24:17] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 5 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 5 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:24:18] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:24:19] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 19 ms to minimize.
[2024-06-01 20:24:19] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:24:19] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:24:19] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 4 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:24:20] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 5 ms to minimize.
[2024-06-01 20:24:21] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:24:22] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:24:23] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 4 ms to minimize.
[2024-06-01 20:24:23] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 3 ms to minimize.
[2024-06-01 20:24:23] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:24:24] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:24:25] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 4 ms to minimize.
[2024-06-01 20:24:26] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:24:27] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:24:27] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:24:28] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:24:29] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 4 ms to minimize.
[2024-06-01 20:24:29] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 4 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:24:30] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:24:31] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:24:31] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:24:31] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:24:32] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:24:33] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:24:34] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:24:35] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:24:36] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:24:36] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:24:36] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:24:37] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:24:37] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:24:37] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:24:37] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:24:38] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:24:38] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:24:38] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:24:38] [INFO ] Deduced a trap composed of 43 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:24:39] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:24:39] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:24:39] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:24:39] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:24:40] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:24:40] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:24:40] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:24:40] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:24:40] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:24:41] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:24:41] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:24:41] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:24:42] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:24:42] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:24:42] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:24:42] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:24:44] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:24:44] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:24:45] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:24:46] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:24:47] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:24:47] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:24:48] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:24:48] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:24:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:24:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:24:49] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:24:49] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:24:49] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:24:49] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:24:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:24:50] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:24:51] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:24:53] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:24:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:24:58] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:24:58] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:24:59] [INFO ] Trap strengthening (SAT) tested/added 114/114 trap constraints in 44570 ms
[2024-06-01 20:24:59] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 20:25:00] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2024-06-01 20:25:00] [INFO ] [Real]Added 205 Read/Feed constraints in 39 ms returned sat
[2024-06-01 20:25:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:25:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 20:25:00] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-06-01 20:25:00] [INFO ] [Nat]Added 205 Read/Feed constraints in 39 ms returned sat
[2024-06-01 20:25:00] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 76 ms.
[2024-06-01 20:25:01] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:25:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-06-01 20:25:01] [INFO ] Added : 61 causal constraints over 13 iterations in 1228 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[6, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[6, 1]
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 25 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 24 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-06-01 20:25:02] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:25:02] [INFO ] Invariant cache hit.
[2024-06-01 20:25:02] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-06-01 20:25:02] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:25:02] [INFO ] Invariant cache hit.
[2024-06-01 20:25:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:25:04] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-06-01 20:25:04] [INFO ] Redundant transitions in 63 ms returned []
Running 674 sub problems to find dead transitions.
[2024-06-01 20:25:04] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:25:04] [INFO ] Invariant cache hit.
[2024-06-01 20:25:04] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:12] [INFO ] Deduced a trap composed of 10 places in 467 ms of which 34 ms to minimize.
[2024-06-01 20:25:13] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 3 ms to minimize.
[2024-06-01 20:25:13] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 8 ms to minimize.
[2024-06-01 20:25:13] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 2 ms to minimize.
[2024-06-01 20:25:13] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:25:13] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 4 ms to minimize.
[2024-06-01 20:25:14] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:25:14] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 3 ms to minimize.
[2024-06-01 20:25:14] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:25:14] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 4 ms to minimize.
[2024-06-01 20:25:15] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:25:15] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:25:15] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:25:15] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:25:15] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:25:16] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:25:16] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:25:16] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:25:16] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:25:17] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:17] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:25:17] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:25:18] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 5 ms to minimize.
[2024-06-01 20:25:18] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 2 ms to minimize.
[2024-06-01 20:25:18] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:25:18] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:25:18] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:25:19] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:25:19] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:25:19] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:25:19] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:25:20] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:25:21] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:28] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:25:29] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:25:30] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:25:31] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:25:32] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:25:34] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/826 variables, and 349 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30076 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 66/349 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:37] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:25:37] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:25:37] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:25:38] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:25:38] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:25:38] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:25:38] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 4 ms to minimize.
[2024-06-01 20:25:38] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:25:39] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:25:39] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:25:39] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:25:39] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:25:39] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:25:40] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:25:40] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:25:40] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:25:40] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:25:40] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:25:41] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-06-01 20:25:41] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/369 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:25:44] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:25:45] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:25:46] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:25:47] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:25:50] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:25:51] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:25:52] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:25:53] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 4 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 3 ms to minimize.
[2024-06-01 20:25:54] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:25:55] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/409 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:25:59] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:26:00] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:26:00] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:26:01] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:26:01] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:26:02] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:26:03] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 4 ms to minimize.
[2024-06-01 20:26:03] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 4 ms to minimize.
[2024-06-01 20:26:03] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:26:04] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 5 ms to minimize.
[2024-06-01 20:26:04] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:26:05] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
SMT process timed out in 60801ms, After SMT, problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62915 ms. Remains : 266/266 places, 680/680 transitions.
RANDOM walk for 40000 steps (8 resets) in 1471 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 467159 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 4
Probabilistic random walk after 467159 steps, saw 68610 distinct states, run finished after 3018 ms. (steps per millisecond=154 ) properties seen :0
[2024-06-01 20:26:08] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:26:08] [INFO ] Invariant cache hit.
[2024-06-01 20:26:09] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 30/826 variables, 30/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/826 variables, 30/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 908 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/826 variables, 30/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 30/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:26:10] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 2 ms to minimize.
[2024-06-01 20:26:11] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2024-06-01 20:26:11] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:26:11] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:26:11] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 2 ms to minimize.
[2024-06-01 20:26:11] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:26:12] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:26:12] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 5 ms to minimize.
[2024-06-01 20:26:12] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:26:13] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:26:13] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:26:13] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:26:14] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:26:14] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 20:26:14] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:26:14] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:26:15] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 6123ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 17 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 266/266 places, 680/680 transitions.
RANDOM walk for 40000 steps (8 resets) in 374 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 551264 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 3
Probabilistic random walk after 551264 steps, saw 80355 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-06-01 20:26:18] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:26:18] [INFO ] Invariant cache hit.
[2024-06-01 20:26:18] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/236 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 560/796 variables, 236/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 205/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 30/826 variables, 30/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/826 variables, 30/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/826 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/826 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 754 constraints, problems are : Problem set: 0 solved, 3 unsolved in 478 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 223/230 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:19] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 6/236 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 6/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 560/796 variables, 236/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 205/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/796 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/826 variables, 30/723 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/826 variables, 30/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/826 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 4 ms to minimize.
[2024-06-01 20:26:20] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 4 ms to minimize.
[2024-06-01 20:26:21] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:26:22] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 2 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:26:23] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:26:24] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 4 ms to minimize.
[2024-06-01 20:26:24] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:26:24] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:26:24] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:26:25] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/826 variables, 20/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:25] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:26:25] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:26:26] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:26:26] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:26:26] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:26:26] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:26:27] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:26:27] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:26:27] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:26:28] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:26:28] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:26:28] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:26:28] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 5 ms to minimize.
[2024-06-01 20:26:29] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 4 ms to minimize.
[2024-06-01 20:26:29] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:26:29] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:26:29] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:26:30] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:26:30] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:26:30] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/826 variables, 20/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:31] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 4 ms to minimize.
[2024-06-01 20:26:31] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:26:31] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:26:31] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 16 ms to minimize.
[2024-06-01 20:26:32] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:26:33] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:26:34] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 4 ms to minimize.
[2024-06-01 20:26:35] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/826 variables, 20/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 4 ms to minimize.
[2024-06-01 20:26:36] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:26:37] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 5 ms to minimize.
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:26:38] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:26:39] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2024-06-01 20:26:39] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:26:39] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:26:39] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:26:40] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:26:40] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:26:40] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 4 ms to minimize.
[2024-06-01 20:26:40] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:26:41] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/826 variables, 20/838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:41] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:26:41] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:26:42] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:26:42] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:26:42] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:26:42] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:26:43] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:26:44] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:26:44] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:26:44] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:26:44] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:26:44] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2024-06-01 20:26:45] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:26:45] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:26:45] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:26:45] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:26:46] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:26:46] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:26:46] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:26:47] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/826 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:47] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:26:48] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 4 ms to minimize.
[2024-06-01 20:26:48] [INFO ] Deduced a trap composed of 57 places in 247 ms of which 3 ms to minimize.
[2024-06-01 20:26:48] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:26:48] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:26:49] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:26:49] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 4 ms to minimize.
[2024-06-01 20:26:49] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:26:50] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:26:50] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 4 ms to minimize.
[2024-06-01 20:26:50] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:26:50] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:26:51] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:26:51] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:26:51] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:26:52] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:26:52] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:26:52] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:26:52] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:26:53] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/826 variables, 20/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:26:54] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:26:54] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:26:55] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:26:55] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:26:55] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:26:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-06-01 20:26:56] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 4 ms to minimize.
[2024-06-01 20:26:56] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-06-01 20:26:57] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:26:57] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:26:57] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:26:57] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:26:58] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 3 ms to minimize.
[2024-06-01 20:26:58] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/826 variables, 14/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 892 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45009 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 266/266 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 135/135 constraints]
After SMT, in 45511ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 18 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 266/266 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Applied a total of 0 rules in 14 ms. Remains 266 /266 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-06-01 20:27:04] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:27:04] [INFO ] Invariant cache hit.
[2024-06-01 20:27:04] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 20:27:04] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:27:04] [INFO ] Invariant cache hit.
[2024-06-01 20:27:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:27:05] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2024-06-01 20:27:05] [INFO ] Redundant transitions in 13 ms returned []
Running 674 sub problems to find dead transitions.
[2024-06-01 20:27:05] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:27:05] [INFO ] Invariant cache hit.
[2024-06-01 20:27:05] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 5 ms to minimize.
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 5 ms to minimize.
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 30 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:27:14] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:27:14] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:27:14] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:27:14] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:27:14] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:27:15] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:27:15] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:27:15] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:27:15] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:27:15] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:27:16] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:17] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:27:17] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:27:17] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:27:18] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:27:18] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:27:18] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:27:18] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 4 ms to minimize.
[2024-06-01 20:27:18] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:27:19] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 2 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:27:20] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:26] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:27:27] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:27:27] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:27:27] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:27:27] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 4 ms to minimize.
[2024-06-01 20:27:27] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 4 ms to minimize.
[2024-06-01 20:27:28] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:27:28] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:27:28] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:27:28] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:27:28] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:27:29] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:27:30] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:27:30] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:27:30] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:31] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:27:31] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:27:33] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/826 variables, and 363 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30025 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 266/266 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 17/283 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 80/363 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:40] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:27:40] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:27:41] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-06-01 20:27:41] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:27:41] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:27:42] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:27:42] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 4 ms to minimize.
[2024-06-01 20:27:42] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:27:42] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:27:43] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:27:43] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:27:44] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:27:44] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:27:44] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:27:45] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 4 ms to minimize.
[2024-06-01 20:27:45] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:27:45] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:27:45] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:27:46] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:27:46] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 674 unsolved
[2024-06-01 20:27:54] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:27:54] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:27:54] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:27:56] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:27:56] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:27:56] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:27:57] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:27:57] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:27:57] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:27:57] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:27:58] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:27:58] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-06-01 20:27:58] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:27:59] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:28:00] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/826 variables, and 403 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30027 ms.
Refiners :[Domain max(s): 266/266 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/266 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/674 constraints, Known Traps: 120/120 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62410 ms. Remains : 266/266 places, 680/680 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0] Max Struct:[6, 1]
Starting property specific reduction for Peterson-PT-5-UpperBounds-07
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-06-01 20:28:06] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:28:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-06-01 20:28:06] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:28:06] [INFO ] Invariant cache hit.
[2024-06-01 20:28:06] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-06-01 20:28:06] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-01 20:28:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:28:06] [INFO ] [Real]Added 205 Read/Feed constraints in 36 ms returned sat
[2024-06-01 20:28:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:28:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-06-01 20:28:07] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-06-01 20:28:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 62 ms returned sat
[2024-06-01 20:28:07] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:28:07] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:28:08] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:28:08] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:28:08] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:28:09] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:28:09] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:28:09] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:28:09] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:28:10] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 5 ms to minimize.
[2024-06-01 20:28:10] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:28:10] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:28:11] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:28:11] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:28:11] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:28:12] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:28:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 680/680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 266 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 265 transition count 679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 265 transition count 678
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 264 transition count 678
Applied a total of 4 rules in 44 ms. Remains 264 /266 variables (removed 2) and now considering 678/680 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 264/266 places, 678/680 transitions.
[2024-06-01 20:28:12] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
// Phase 1: matrix 558 rows 264 cols
[2024-06-01 20:28:12] [INFO ] Computed 17 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2084 ms. (479 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 632 ms. (1579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-06-01 20:28:14] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:28:14] [INFO ] Invariant cache hit.
[2024-06-01 20:28:14] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 20:28:15] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-01 20:28:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:28:15] [INFO ] [Real]Added 205 Read/Feed constraints in 34 ms returned sat
[2024-06-01 20:28:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:28:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 20:28:15] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-06-01 20:28:15] [INFO ] [Nat]Added 205 Read/Feed constraints in 74 ms returned sat
[2024-06-01 20:28:15] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 4 ms to minimize.
[2024-06-01 20:28:16] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:28:16] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 3 ms to minimize.
[2024-06-01 20:28:16] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:28:17] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:28:17] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 3 ms to minimize.
[2024-06-01 20:28:17] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 4 ms to minimize.
[2024-06-01 20:28:17] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:28:18] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:28:18] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:28:18] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:28:19] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:28:19] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:28:19] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:28:19] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:28:19] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:28:20] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-06-01 20:28:21] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-06-01 20:28:22] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:28:22] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:28:22] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:28:22] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:28:22] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:28:23] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:28:23] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:28:23] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 2 ms to minimize.
[2024-06-01 20:28:23] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:28:23] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 2 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-06-01 20:28:24] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:28:25] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:28:25] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:28:25] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:28:25] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:28:25] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:28:27] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:28:27] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:28:27] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:28:27] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:28:28] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:28:28] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:28:28] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:28:28] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:28:29] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:28:29] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:28:29] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:28:30] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:28:30] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:28:30] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:28:30] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:28:31] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:28:31] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:28:31] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-06-01 20:28:31] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:28:32] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:28:32] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-01 20:28:32] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:28:32] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 4 ms to minimize.
[2024-06-01 20:28:33] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:28:33] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:28:33] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:28:33] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:28:34] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:28:34] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:28:34] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:28:34] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:28:35] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:28:35] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:28:36] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:28:36] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:28:37] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:28:38] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:28:39] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 4 ms to minimize.
[2024-06-01 20:28:39] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 4 ms to minimize.
[2024-06-01 20:28:39] [INFO ] Deduced a trap composed of 34 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:28:39] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 4 ms to minimize.
[2024-06-01 20:28:40] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:28:41] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:28:41] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:28:42] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:28:42] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 4 ms to minimize.
[2024-06-01 20:28:42] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 4 ms to minimize.
[2024-06-01 20:28:44] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:28:44] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:28:45] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:28:45] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:28:45] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:28:46] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:28:46] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:28:47] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:28:47] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 36046 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 13 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 264/264 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2024-06-01 20:28:51] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:28:51] [INFO ] Invariant cache hit.
[2024-06-01 20:28:52] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-06-01 20:28:52] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:28:52] [INFO ] Invariant cache hit.
[2024-06-01 20:28:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:28:53] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2024-06-01 20:28:53] [INFO ] Redundant transitions in 9 ms returned []
Running 672 sub problems to find dead transitions.
[2024-06-01 20:28:53] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:28:53] [INFO ] Invariant cache hit.
[2024-06-01 20:28:53] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 17/281 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 20:29:01] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:29:01] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:29:02] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 4 ms to minimize.
[2024-06-01 20:29:02] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:29:02] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 5 ms to minimize.
[2024-06-01 20:29:03] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:29:03] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:29:03] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:29:03] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:29:04] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:29:04] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:29:04] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:29:04] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 4 ms to minimize.
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:29:06] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:29:06] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 20:29:07] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 4 ms to minimize.
[2024-06-01 20:29:07] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:29:07] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:29:08] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:29:08] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:29:08] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 4 ms to minimize.
[2024-06-01 20:29:08] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:29:09] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:29:09] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:29:09] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 3 ms to minimize.
[2024-06-01 20:29:09] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 20:29:18] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 4 ms to minimize.
[2024-06-01 20:29:18] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 4 ms to minimize.
[2024-06-01 20:29:18] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 3 ms to minimize.
[2024-06-01 20:29:18] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:29:19] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:29:19] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:29:19] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 4 ms to minimize.
[2024-06-01 20:29:19] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 4 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:29:22] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:29:22] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:29:22] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 20:29:23] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:29:23] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:29:24] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:29:24] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
SMT process timed out in 30351ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32471 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 611877 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 611877 steps, saw 88235 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2024-06-01 20:29:27] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:29:27] [INFO ] Invariant cache hit.
[2024-06-01 20:29:27] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 222/228 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 222/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/234 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 558/792 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 205/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/822 variables, 30/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 30/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/822 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 750 constraints, problems are : Problem set: 0 solved, 2 unsolved in 470 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 222/228 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 222/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/234 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 558/792 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 205/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/792 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/822 variables, 30/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 30/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 5/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:29:28] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:29:29] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:29:29] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 3 ms to minimize.
[2024-06-01 20:29:29] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 35 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:29:31] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:29:31] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 4 ms to minimize.
[2024-06-01 20:29:31] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:29:32] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:29:32] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 20:29:32] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 4 ms to minimize.
[2024-06-01 20:29:32] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 4 ms to minimize.
SMT process timed out in 5542ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 678/678 transitions.
Applied a total of 0 rules in 16 ms. Remains 264 /264 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 264/264 places, 678/678 transitions.
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 809676 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 809676 steps, saw 117704 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2024-06-01 20:29:36] [INFO ] Flow matrix only has 558 transitions (discarded 120 similar events)
[2024-06-01 20:29:36] [INFO ] Invariant cache hit.
[2024-06-01 20:29:36] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 222/228 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 222/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/234 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 558/792 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 205/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/822 variables, 30/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 30/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 5/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/822 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 750 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 222/228 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 222/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:36] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/234 variables, 6/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 558/792 variables, 234/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 205/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/792 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/792 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 30/822 variables, 30/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 30/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 5/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:37] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:29:37] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:29:37] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:29:37] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
[2024-06-01 20:29:40] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:29:40] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:29:40] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 3 ms to minimize.
[2024-06-01 20:29:41] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 4 ms to minimize.
[2024-06-01 20:29:41] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:29:41] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:29:41] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 20/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:29:43] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:29:43] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:29:43] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 9 ms to minimize.
[2024-06-01 20:29:43] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:29:44] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:29:44] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:29:44] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:29:45] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:29:45] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:29:45] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:29:45] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:29:46] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 4 ms to minimize.
[2024-06-01 20:29:46] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:29:46] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 4 ms to minimize.
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 20/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:29:48] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:29:48] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 4 ms to minimize.
[2024-06-01 20:29:48] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:29:48] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:29:49] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:29:49] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:29:49] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:29:50] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:29:50] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:29:50] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:29:50] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:29:50] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:29:51] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:29:51] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:29:51] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:29:51] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/822 variables, 20/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:52] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:29:52] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:29:53] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:29:53] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:29:53] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-06-01 20:29:53] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:29:54] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:29:54] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:29:54] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:29:54] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:29:55] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:29:55] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:29:55] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:29:55] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:29:56] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:29:56] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:29:56] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:29:57] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:29:57] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:29:57] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/822 variables, 20/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:29:58] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:29:58] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:29:58] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:29:58] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:29:58] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:29:59] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-06-01 20:29:59] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:29:59] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:29:59] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 20:29:59] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:30:00] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:30:00] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:30:00] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:30:01] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:30:01] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:30:01] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:30:03] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:30:04] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-06-01 20:30:04] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:30:04] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/822 variables, 20/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:30:05] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 4 ms to minimize.
[2024-06-01 20:30:05] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:30:05] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 4 ms to minimize.
[2024-06-01 20:30:05] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:30:06] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:30:06] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:30:06] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:30:06] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:30:07] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 4 ms to minimize.
[2024-06-01 20:30:07] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:30:08] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:30:08] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 4 ms to minimize.
[2024-06-01 20:30:08] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:30:08] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:30:08] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:30:09] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:30:10] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-06-01 20:30:10] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:30:10] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:30:11] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/822 variables, 20/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:30:12] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:30:12] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:30:13] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 7 ms to minimize.
[2024-06-01 20:30:13] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:30:14] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 822/822 variables, and 877 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40054 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 264/264 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 126/126 constraints]
After SMT, in 40487ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Peterson-PT-5-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Peterson-PT-5-UpperBounds-07 in 130134 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 20:30:16] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
// Phase 1: matrix 560 rows 266 cols
[2024-06-01 20:30:16] [INFO ] Computed 17 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 20:30:16] [INFO ] Flow matrix only has 560 transitions (discarded 120 similar events)
[2024-06-01 20:30:16] [INFO ] Invariant cache hit.
[2024-06-01 20:30:16] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-06-01 20:30:16] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-01 20:30:16] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:30:16] [INFO ] [Real]Added 205 Read/Feed constraints in 40 ms returned sat
[2024-06-01 20:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:30:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-06-01 20:30:17] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-06-01 20:30:17] [INFO ] [Nat]Added 205 Read/Feed constraints in 45 ms returned sat
[2024-06-01 20:30:17] [INFO ] Computed and/alt/rep : 494/1550/494 causal constraints (skipped 60 transitions) in 71 ms.
[2024-06-01 20:30:18] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 4 ms to minimize.
[2024-06-01 20:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2024-06-01 20:30:18] [INFO ] Added : 61 causal constraints over 13 iterations in 1208 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 266 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place TestIdentity_1_4_3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 679/679 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 265 transition count 677
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 264 transition count 675
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 263 transition count 673
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 3 place count 263 transition count 667
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 15 place count 257 transition count 667
Applied a total of 15 rules in 37 ms. Remains 257 /266 variables (removed 9) and now considering 667/679 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 257/266 places, 667/679 transitions.
[2024-06-01 20:30:19] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2024-06-01 20:30:19] [INFO ] Computed 17 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1823 ms. (548 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 550 ms. (1814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 20:30:21] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-06-01 20:30:21] [INFO ] Invariant cache hit.
[2024-06-01 20:30:21] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-06-01 20:30:21] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-01 20:30:21] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-06-01 20:30:21] [INFO ] [Real]Added 202 Read/Feed constraints in 38 ms returned sat
[2024-06-01 20:30:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:30:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2024-06-01 20:30:22] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2024-06-01 20:30:22] [INFO ] [Nat]Added 202 Read/Feed constraints in 43 ms returned sat
[2024-06-01 20:30:22] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 69 ms.
[2024-06-01 20:30:22] [INFO ] Added : 23 causal constraints over 5 iterations in 378 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 12 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2024-06-01 20:30:23] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-06-01 20:30:23] [INFO ] Invariant cache hit.
[2024-06-01 20:30:23] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-01 20:30:23] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-06-01 20:30:23] [INFO ] Invariant cache hit.
[2024-06-01 20:30:23] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-06-01 20:30:24] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2024-06-01 20:30:24] [INFO ] Redundant transitions in 8 ms returned []
Running 661 sub problems to find dead transitions.
[2024-06-01 20:30:24] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-06-01 20:30:24] [INFO ] Invariant cache hit.
[2024-06-01 20:30:24] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:30] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:30:30] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:30:30] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2024-06-01 20:30:31] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:30:32] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-06-01 20:30:33] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:30:33] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:30:33] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:30:33] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:34] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:30:34] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:30:34] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 4 ms to minimize.
[2024-06-01 20:30:34] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:30:34] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 1 ms to minimize.
[2024-06-01 20:30:35] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-06-01 20:30:35] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:30:35] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 2 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:30:36] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-06-01 20:30:37] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:30:37] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 4 ms to minimize.
[2024-06-01 20:30:37] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:30:37] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:43] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:30:43] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:30:43] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:30:44] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:30:44] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:30:44] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:30:45] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:30:45] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 2 ms to minimize.
[2024-06-01 20:30:45] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 3 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:30:46] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:30:47] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:30:47] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:30:47] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:30:47] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:30:47] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/332 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:48] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:30:48] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:30:49] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:30:49] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:30:50] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:30:51] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:30:52] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:30:52] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:30:52] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:53] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 3 ms to minimize.
[2024-06-01 20:30:53] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/804 variables, and 354 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30028 ms.
Refiners :[Domain max(s): 256/257 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/257 constraints, ReadFeed: 0/202 constraints, PredecessorRefiner: 661/661 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 16/272 constraints. Problems are: Problem set: 0 solved, 661 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 82/354 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:30:57] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:30:58] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:30:58] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:30:58] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:30:59] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:30:59] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:30:59] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
[2024-06-01 20:30:59] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-01 20:31:00] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:31:00] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:31:01] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:31:02] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 4 ms to minimize.
[2024-06-01 20:31:02] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:31:03] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:31:03] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:31:03] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:31:04] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:31:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:31:04] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:31:04] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:31:05] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:31:05] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-06-01 20:31:07] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:31:07] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:31:08] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:31:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:31:08] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:31:08] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-06-01 20:31:12] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:31:12] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:31:12] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:31:13] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:31:13] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:31:13] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:31:13] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:31:14] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 2 ms to minimize.
[2024-06-01 20:31:14] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:31:14] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:31:15] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:31:15] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 661 unsolved
[2024-06-01 20:31:22] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/804 variables, and 395 constraints, problems are : Problem set: 0 solved, 661 unsolved in 30029 ms.
Refiners :[Domain max(s): 256/257 constraints, Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/257 constraints, ReadFeed: 0/202 constraints, PredecessorRefiner: 0/661 constraints, Known Traps: 123/123 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 661 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62034 ms. Remains : 257/257 places, 667/667 transitions.
[2024-06-01 20:31:25] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2024-06-01 20:31:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1963 ms. (509 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 70455 ms.
[2024-06-01 20:31:27] [INFO ] Flatten gal took : 161 ms
Total runtime 552431 ms.
ITS solved all properties within timeout
BK_STOP 1717273887533
--------------------
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 UpperBounds -timeout 360 -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="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300277"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;