About the Execution of GreatSPN+red for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2258.348 | 1800000.00 | 2890320.00 | 3197.00 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905900203.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 greatspnxred
Input is FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1717353765209
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:42:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:42:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:42:46] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-02 18:42:46] [INFO ] Transformed 626 places.
[2024-06-02 18:42:46] [INFO ] Transformed 1031 transitions.
[2024-06-02 18:42:46] [INFO ] Found NUPN structural information;
[2024-06-02 18:42:46] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 210 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 24 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (464 resets) in 2750 ms. (14 steps per ms) remains 385/533 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 385/385 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 385/385 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 385/385 properties
[2024-06-02 18:42:47] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
// Phase 1: matrix 1019 rows 617 cols
[2024-06-02 18:42:47] [INFO ] Computed 13 invariants in 18 ms
[2024-06-02 18:42:47] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1636 variables, and 385 constraints, problems are : Problem set: 0 solved, 385 unsolved in 5125 ms.
Refiners :[Domain max(s): 385/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 385/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 232/617 variables, 13/398 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 232/630 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 39 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 164 places in 268 ms of which 5 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:42:56] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 4 ms to minimize.
[2024-06-02 18:42:57] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 4 ms to minimize.
[2024-06-02 18:42:57] [INFO ] Deduced a trap composed of 127 places in 234 ms of which 4 ms to minimize.
[2024-06-02 18:42:57] [INFO ] Deduced a trap composed of 182 places in 242 ms of which 4 ms to minimize.
[2024-06-02 18:42:58] [INFO ] Deduced a trap composed of 129 places in 220 ms of which 4 ms to minimize.
[2024-06-02 18:42:58] [INFO ] Deduced a trap composed of 307 places in 227 ms of which 4 ms to minimize.
SMT process timed out in 10424ms, After SMT, problems are : Problem set: 0 solved, 385 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 385 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 611 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 611 transition count 960
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 60 rules applied. Total rules applied 122 place count 553 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 552 transition count 958
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 123 place count 552 transition count 948
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 143 place count 542 transition count 948
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 158 place count 527 transition count 933
Iterating global reduction 3 with 15 rules applied. Total rules applied 173 place count 527 transition count 933
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 527 transition count 930
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 524 transition count 840
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 524 transition count 840
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 184 place count 524 transition count 838
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 236 place count 498 transition count 812
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 258 place count 487 transition count 825
Free-agglomeration rule applied 21 times.
Iterating global reduction 5 with 21 rules applied. Total rules applied 279 place count 487 transition count 804
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 303 place count 466 transition count 801
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 306 place count 466 transition count 798
Applied a total of 306 rules in 190 ms. Remains 466 /617 variables (removed 151) and now considering 798/1021 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 466/617 places, 798/1021 transitions.
RANDOM walk for 4000000 steps (183624 resets) in 58260 ms. (68 steps per ms) remains 178/385 properties
BEST_FIRST walk for 40003 steps (336 resets) in 130 ms. (305 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (328 resets) in 138 ms. (287 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (336 resets) in 116 ms. (341 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (327 resets) in 101 ms. (392 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (350 resets) in 93 ms. (425 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (359 resets) in 96 ms. (412 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (340 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (335 resets) in 101 ms. (392 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (340 resets) in 94 ms. (421 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (329 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (336 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (333 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (319 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (341 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (341 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (333 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (339 resets) in 99 ms. (400 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (339 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (351 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (349 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (351 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (334 resets) in 94 ms. (421 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (349 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (339 resets) in 96 ms. (412 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (346 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (338 resets) in 100 ms. (396 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (342 resets) in 94 ms. (421 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (335 resets) in 99 ms. (400 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (333 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (345 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (345 resets) in 133 ms. (298 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (342 resets) in 114 ms. (347 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (333 resets) in 104 ms. (380 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (331 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (335 resets) in 99 ms. (400 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (344 resets) in 96 ms. (412 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (344 resets) in 93 ms. (425 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (342 resets) in 99 ms. (400 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (322 resets) in 100 ms. (396 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (344 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (347 resets) in 98 ms. (404 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (338 resets) in 157 ms. (253 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (344 resets) in 145 ms. (274 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (340 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (343 resets) in 96 ms. (412 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40002 steps (328 resets) in 97 ms. (408 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (333 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (316 resets) in 101 ms. (392 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (320 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40003 steps (331 resets) in 95 ms. (416 steps per ms) remains 178/178 properties
[2024-06-02 18:43:16] [INFO ] Flow matrix only has 796 transitions (discarded 2 similar events)
// Phase 1: matrix 796 rows 466 cols
[2024-06-02 18:43:16] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:43:16] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 257/435 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 20/455 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 795/1250 variables, 455/465 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 37/502 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 12/1262 variables, 11/513 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1262 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/1262 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1262/1262 variables, and 513 constraints, problems are : Problem set: 0 solved, 178 unsolved in 26079 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 466/466 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 257/435 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:43] [INFO ] Deduced a trap composed of 105 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:43:43] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:43:43] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 104 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 110 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 110 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 98 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:43:46] [INFO ] Deduced a trap composed of 113 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:43:48] [INFO ] Deduced a trap composed of 125 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:49] [INFO ] Deduced a trap composed of 119 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:43:49] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:43:50] [INFO ] Deduced a trap composed of 124 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:51] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:52] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:43:53] [INFO ] Deduced a trap composed of 108 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 20/455 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:43:57] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-06-02 18:43:57] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-06-02 18:43:57] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-06-02 18:43:58] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:44:00] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:44:02] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-06-02 18:44:02] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 795/1250 variables, 455/494 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1250 variables, 37/531 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1250 variables, 178/709 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:44:07] [INFO ] Deduced a trap composed of 109 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:44:08] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-06-02 18:44:09] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:44:10] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1250 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 18:44:19] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1250 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/1262 variables, and 714 constraints, problems are : Problem set: 0 solved, 178 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 455/466 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 34/34 constraints]
After SMT, in 71147ms problems are : Problem set: 0 solved, 178 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 178 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 798/798 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 466 transition count 742
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 410 transition count 742
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 112 place count 410 transition count 739
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 407 transition count 739
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 134 place count 391 transition count 718
Iterating global reduction 2 with 16 rules applied. Total rules applied 150 place count 391 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 150 place count 391 transition count 717
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 390 transition count 717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 387 transition count 711
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 387 transition count 711
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 384 transition count 708
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 384 transition count 708
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 170 place count 384 transition count 702
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 173 place count 381 transition count 702
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 223 place count 356 transition count 677
Performed 20 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 263 place count 336 transition count 728
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 266 place count 336 transition count 725
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 288 place count 336 transition count 703
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 299 place count 336 transition count 692
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 310 place count 325 transition count 692
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 313 place count 325 transition count 897
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 316 place count 322 transition count 897
Applied a total of 316 rules in 118 ms. Remains 322 /466 variables (removed 144) and now considering 897/798 (removed -99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 322/466 places, 897/798 transitions.
RANDOM walk for 4000000 steps (86685 resets) in 36961 ms. (108 steps per ms) remains 68/178 properties
BEST_FIRST walk for 400001 steps (1779 resets) in 1042 ms. (383 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (1771 resets) in 1017 ms. (392 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (1849 resets) in 971 ms. (411 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 921 ms. (433 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (1784 resets) in 1060 ms. (377 steps per ms) remains 65/68 properties
BEST_FIRST walk for 400002 steps (1826 resets) in 977 ms. (409 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (1833 resets) in 972 ms. (411 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 1061 ms. (376 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400001 steps (1828 resets) in 1019 ms. (392 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400002 steps (1814 resets) in 986 ms. (405 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1824 resets) in 1025 ms. (389 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1819 resets) in 1014 ms. (394 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (1756 resets) in 960 ms. (416 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1799 resets) in 984 ms. (406 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (1766 resets) in 987 ms. (404 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1799 resets) in 893 ms. (447 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 1023 ms. (390 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400004 steps (1832 resets) in 929 ms. (430 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 1044 ms. (382 steps per ms) remains 63/65 properties
BEST_FIRST walk for 400002 steps (1811 resets) in 1768 ms. (226 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 1002 ms. (398 steps per ms) remains 60/62 properties
BEST_FIRST walk for 400004 steps (1813 resets) in 1004 ms. (398 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (1840 resets) in 965 ms. (414 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (1826 resets) in 995 ms. (401 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (1871 resets) in 892 ms. (447 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (1826 resets) in 980 ms. (407 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (1818 resets) in 983 ms. (406 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (1811 resets) in 959 ms. (416 steps per ms) remains 58/60 properties
BEST_FIRST walk for 400003 steps (1834 resets) in 964 ms. (414 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1809 resets) in 969 ms. (412 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400001 steps (1840 resets) in 979 ms. (408 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1780 resets) in 967 ms. (413 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 986 ms. (405 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1828 resets) in 977 ms. (409 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1839 resets) in 985 ms. (405 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1833 resets) in 974 ms. (410 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1790 resets) in 986 ms. (405 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 953 ms. (419 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1777 resets) in 863 ms. (462 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1816 resets) in 1194 ms. (334 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 1003 ms. (398 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1851 resets) in 988 ms. (404 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 980 ms. (407 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1842 resets) in 995 ms. (401 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1818 resets) in 1015 ms. (393 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 974 ms. (410 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400001 steps (1847 resets) in 983 ms. (406 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1838 resets) in 999 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1779 resets) in 983 ms. (406 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1842 resets) in 1000 ms. (399 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1817 resets) in 1020 ms. (391 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1849 resets) in 1094 ms. (365 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1794 resets) in 1026 ms. (389 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 988 ms. (404 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1844 resets) in 987 ms. (404 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (1787 resets) in 973 ms. (410 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (1814 resets) in 970 ms. (411 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1781 resets) in 997 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (1789 resets) in 974 ms. (410 steps per ms) remains 58/58 properties
[2024-06-02 18:45:02] [INFO ] Flow matrix only has 890 transitions (discarded 7 similar events)
// Phase 1: matrix 890 rows 322 cols
[2024-06-02 18:45:02] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:45:02] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 204/262 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 40/302 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 882/1184 variables, 302/312 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1184 variables, 99/411 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 25/1209 variables, 17/428 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1209 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 3/1212 variables, 3/431 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1212 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/1212 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 431 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 204/262 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 40/302 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:45:07] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:45:08] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 882/1184 variables, 302/320 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 99/419 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1184 variables, 58/477 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-06-02 18:45:09] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:45:10] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 25/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1209 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 3/1212 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1212 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 15 (OVERLAPS) 0/1212 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 499 constraints, problems are : Problem set: 0 solved, 58 unsolved in 13637 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 322/322 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 10/10 constraints]
After SMT, in 17792ms problems are : Problem set: 0 solved, 58 unsolved
Parikh walk visited 0 properties in 6395 ms.
Support contains 58 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 897/897 transitions.
Graph (complete) has 1424 edges and 322 vertex of which 319 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 319 transition count 890
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 315 transition count 890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 315 transition count 889
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 14 place count 314 transition count 889
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 40 place count 288 transition count 863
Iterating global reduction 2 with 26 rules applied. Total rules applied 66 place count 288 transition count 863
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 288 transition count 860
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 285 transition count 860
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 87 place count 270 transition count 836
Iterating global reduction 2 with 15 rules applied. Total rules applied 102 place count 270 transition count 836
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 268 transition count 832
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 268 transition count 832
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 144 place count 249 transition count 813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 249 transition count 812
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 151 place count 243 transition count 788
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 243 transition count 788
Performed 9 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 175 place count 234 transition count 792
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 234 transition count 788
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 234 transition count 786
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 183 place count 232 transition count 786
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 232 transition count 785
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 190 place count 232 transition count 785
Applied a total of 190 rules in 120 ms. Remains 232 /322 variables (removed 90) and now considering 785/897 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 232/322 places, 785/897 transitions.
RANDOM walk for 4000000 steps (86704 resets) in 47290 ms. (84 steps per ms) remains 56/58 properties
BEST_FIRST walk for 400004 steps (1803 resets) in 1302 ms. (306 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1833 resets) in 1061 ms. (376 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1845 resets) in 1152 ms. (346 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 1413 ms. (282 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (1815 resets) in 1061 ms. (376 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1802 resets) in 1203 ms. (332 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1783 resets) in 1136 ms. (351 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1826 resets) in 1250 ms. (319 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1803 resets) in 1198 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1836 resets) in 1140 ms. (350 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1816 resets) in 1181 ms. (338 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (1825 resets) in 1099 ms. (363 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1778 resets) in 1251 ms. (319 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 1106 ms. (361 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1833 resets) in 1299 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 1265 ms. (315 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 1223 ms. (326 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1839 resets) in 1058 ms. (377 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1787 resets) in 1326 ms. (301 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1828 resets) in 1196 ms. (334 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1768 resets) in 1199 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1834 resets) in 1222 ms. (327 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1773 resets) in 1345 ms. (297 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1804 resets) in 1195 ms. (334 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1855 resets) in 1107 ms. (361 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (1814 resets) in 1212 ms. (329 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1816 resets) in 1238 ms. (322 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1836 resets) in 1139 ms. (350 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1798 resets) in 1095 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (1816 resets) in 1195 ms. (334 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1799 resets) in 1182 ms. (338 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (1819 resets) in 1192 ms. (335 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1801 resets) in 1212 ms. (329 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (1814 resets) in 1246 ms. (320 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1046 ms. (382 steps per ms) remains 54/56 properties
BEST_FIRST walk for 400002 steps (1804 resets) in 1232 ms. (324 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 942 ms. (424 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 963 ms. (414 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1824 resets) in 1012 ms. (394 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (1813 resets) in 942 ms. (424 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1846 resets) in 1119 ms. (357 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 1177 ms. (339 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400002 steps (1794 resets) in 1064 ms. (375 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (1768 resets) in 1103 ms. (362 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (1794 resets) in 1779 ms. (224 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400003 steps (1788 resets) in 1651 ms. (242 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1849 resets) in 1799 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1796 resets) in 1528 ms. (261 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1828 resets) in 1796 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1860 resets) in 1749 ms. (228 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1829 resets) in 1874 ms. (213 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1825 resets) in 1456 ms. (274 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1846 resets) in 1533 ms. (260 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1840 resets) in 1187 ms. (336 steps per ms) remains 52/52 properties
[2024-06-02 18:46:05] [INFO ] Flow matrix only has 778 transitions (discarded 7 similar events)
// Phase 1: matrix 778 rows 232 cols
[2024-06-02 18:46:05] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:46:05] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 126/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 38/216 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 778/994 variables, 216/226 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 96/322 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/994 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 16/1010 variables, 16/338 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/1010 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 338 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 232/232 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 126/178 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 38/216 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:08] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:46:08] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2024-06-02 18:46:08] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:46:09] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:46:09] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:09] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 2 ms to minimize.
[2024-06-02 18:46:09] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:10] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 778/994 variables, 216/234 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/994 variables, 96/330 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/994 variables, 52/382 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:46:11] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/994 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:12] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/994 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/994 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 16/1010 variables, 16/402 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 18:46:15] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1010 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1010 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 17 (OVERLAPS) 0/1010 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 403 constraints, problems are : Problem set: 0 solved, 52 unsolved in 10482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 232/232 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 13/13 constraints]
After SMT, in 12984ms problems are : Problem set: 0 solved, 52 unsolved
Parikh walk visited 0 properties in 6982 ms.
Support contains 52 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 785/785 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 784
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 784
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 229 transition count 782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 227 transition count 780
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 227 transition count 780
Applied a total of 10 rules in 28 ms. Remains 227 /232 variables (removed 5) and now considering 780/785 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 227/232 places, 780/785 transitions.
RANDOM walk for 4000000 steps (86589 resets) in 45780 ms. (87 steps per ms) remains 46/52 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 1106 ms. (361 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1829 resets) in 1115 ms. (358 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1803 resets) in 1096 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1811 resets) in 1147 ms. (348 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1839 resets) in 1010 ms. (395 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1813 resets) in 971 ms. (411 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1816 resets) in 1191 ms. (335 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1138 ms. (351 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1779 resets) in 1161 ms. (344 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1792 resets) in 1187 ms. (336 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1797 resets) in 1172 ms. (341 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1849 resets) in 1130 ms. (353 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1855 resets) in 1107 ms. (361 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1779 resets) in 1113 ms. (359 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1800 resets) in 1166 ms. (342 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1790 resets) in 1142 ms. (349 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1795 resets) in 1054 ms. (379 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1832 resets) in 1110 ms. (360 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1780 resets) in 1083 ms. (369 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1866 resets) in 1032 ms. (387 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1859 resets) in 1136 ms. (351 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 1090 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 1041 ms. (383 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1835 resets) in 1100 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1814 resets) in 1163 ms. (343 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1855 resets) in 1113 ms. (359 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1157 ms. (345 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1799 resets) in 1100 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1812 resets) in 1261 ms. (316 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 1297 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1821 resets) in 1183 ms. (337 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1816 resets) in 1220 ms. (327 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1794 resets) in 1166 ms. (342 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 1090 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1832 resets) in 1031 ms. (387 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1850 resets) in 1091 ms. (366 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1044 ms. (382 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1816 resets) in 1087 ms. (367 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1838 resets) in 927 ms. (431 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 1109 ms. (360 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 1118 ms. (357 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1782 resets) in 1146 ms. (348 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1798 resets) in 834 ms. (479 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1810 resets) in 999 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1776 resets) in 1064 ms. (375 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1769 resets) in 1323 ms. (302 steps per ms) remains 46/46 properties
[2024-06-02 18:46:58] [INFO ] Flow matrix only has 773 transitions (discarded 7 similar events)
// Phase 1: matrix 773 rows 227 cols
[2024-06-02 18:46:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:46:58] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 131/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 34/211 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 773/984 variables, 211/221 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 96/317 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 16/1000 variables, 16/333 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/1000 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 333 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 131/177 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 34/211 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2024-06-02 18:47:00] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:47:01] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:47:01] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:47:01] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:47:01] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 1 ms to minimize.
[2024-06-02 18:47:01] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 773/984 variables, 211/230 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 96/326 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 46/372 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/984 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 16/1000 variables, 16/388 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/1000 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 388 constraints, problems are : Problem set: 0 solved, 46 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 9/9 constraints]
After SMT, in 7381ms problems are : Problem set: 0 solved, 46 unsolved
Fused 46 Parikh solutions to 45 different solutions.
Parikh walk visited 0 properties in 5156 ms.
Support contains 46 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 780/780 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 227 transition count 779
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 779
Applied a total of 2 rules in 12 ms. Remains 226 /227 variables (removed 1) and now considering 779/780 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 226/227 places, 779/780 transitions.
RANDOM walk for 4000000 steps (86550 resets) in 44624 ms. (89 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 1018 ms. (392 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1834 resets) in 913 ms. (437 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 1037 ms. (385 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 947 ms. (421 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1824 resets) in 1031 ms. (387 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1864 resets) in 1248 ms. (320 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1862 resets) in 1123 ms. (355 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1834 resets) in 1085 ms. (368 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1839 resets) in 1121 ms. (356 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1240 ms. (322 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1831 resets) in 1113 ms. (359 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 1107 ms. (361 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1796 resets) in 1092 ms. (365 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1757 resets) in 1106 ms. (361 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1820 resets) in 1187 ms. (336 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1800 resets) in 1059 ms. (377 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1806 resets) in 1225 ms. (326 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1197 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 971 ms. (411 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1816 resets) in 964 ms. (414 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1809 resets) in 964 ms. (414 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1834 resets) in 1263 ms. (316 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400001 steps (1800 resets) in 1043 ms. (383 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1825 resets) in 1116 ms. (358 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1805 resets) in 1101 ms. (362 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1845 resets) in 868 ms. (460 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1813 resets) in 1046 ms. (382 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1806 resets) in 1147 ms. (348 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 995 ms. (401 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1839 resets) in 1163 ms. (343 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1816 resets) in 1140 ms. (350 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1786 resets) in 1036 ms. (385 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1841 resets) in 958 ms. (417 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 1053 ms. (379 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1806 resets) in 1166 ms. (342 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1824 resets) in 997 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1778 resets) in 1197 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1831 resets) in 1118 ms. (357 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1829 resets) in 945 ms. (422 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1834 resets) in 1214 ms. (329 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1836 resets) in 1056 ms. (378 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (1818 resets) in 1157 ms. (345 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1847 resets) in 1065 ms. (375 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (1815 resets) in 1094 ms. (365 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (1818 resets) in 1077 ms. (371 steps per ms) remains 45/45 properties
Interrupted probabilistic random walk after 9931517 steps, run timeout after 99001 ms. (steps per millisecond=100 ) properties seen :15 out of 45
Probabilistic random walk after 9931517 steps, saw 2828406 distinct states, run finished after 99008 ms. (steps per millisecond=100 ) properties seen :15
[2024-06-02 18:49:23] [INFO ] Flow matrix only has 772 transitions (discarded 7 similar events)
// Phase 1: matrix 772 rows 226 cols
[2024-06-02 18:49:23] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:49:23] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 90/205 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 772/977 variables, 205/215 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/977 variables, 96/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 21/998 variables, 21/332 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/998 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 332 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 85/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 90/205 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:49:24] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-02 18:49:24] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:49:24] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:49:25] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 772/977 variables, 205/219 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 96/315 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 30/345 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:49:25] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2024-06-02 18:49:25] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 21/998 variables, 21/368 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/998 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/998 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 368 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3822 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 226/226 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 6/6 constraints]
After SMT, in 5185ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 3430 ms.
Support contains 30 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 779/779 transitions.
Graph (complete) has 1236 edges and 226 vertex of which 222 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output 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 2 place count 222 transition count 778
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 221 transition count 778
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 217 transition count 774
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 217 transition count 774
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 216 transition count 773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 215 transition count 772
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 215 transition count 772
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 214 transition count 777
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 213 transition count 763
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 213 transition count 763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 212 transition count 761
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 212 transition count 761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 211 transition count 754
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 211 transition count 754
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 210 transition count 752
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 210 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 209 transition count 745
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 209 transition count 745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 208 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 208 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 207 transition count 736
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 207 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 206 transition count 734
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 206 transition count 734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 205 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 205 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 204 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 204 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 203 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 203 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 202 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 202 transition count 719
Applied a total of 41 rules in 77 ms. Remains 202 /226 variables (removed 24) and now considering 719/779 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 202/226 places, 719/779 transitions.
RANDOM walk for 4000000 steps (86778 resets) in 38103 ms. (104 steps per ms) remains 27/30 properties
BEST_FIRST walk for 400002 steps (1831 resets) in 967 ms. (413 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 885 ms. (451 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 773 ms. (516 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1838 resets) in 883 ms. (452 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1828 resets) in 888 ms. (449 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1791 resets) in 856 ms. (466 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (1844 resets) in 825 ms. (484 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1817 resets) in 852 ms. (468 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1798 resets) in 805 ms. (496 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1806 resets) in 914 ms. (437 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 847 ms. (471 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1833 resets) in 794 ms. (503 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1802 resets) in 796 ms. (501 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1819 resets) in 968 ms. (412 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 859 ms. (465 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1830 resets) in 785 ms. (508 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1794 resets) in 916 ms. (436 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1792 resets) in 857 ms. (466 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 918 ms. (435 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 772 ms. (517 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1792 resets) in 970 ms. (411 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (1792 resets) in 846 ms. (472 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1840 resets) in 823 ms. (485 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1824 resets) in 752 ms. (531 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 766 ms. (521 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1845 resets) in 1048 ms. (381 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1792 resets) in 835 ms. (478 steps per ms) remains 27/27 properties
[2024-06-02 18:49:51] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 202 cols
[2024-06-02 18:49:51] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:49:51] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 712/900 variables, 188/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 14/914 variables, 14/303 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/914 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/914 variables, and 303 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:49:53] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 712/900 variables, 188/203 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 91/294 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 27/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/900 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 14/914 variables, 14/335 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:49:54] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:49:54] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/914 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/914 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/914 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 914/914 variables, and 337 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3756 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/202 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 7/7 constraints]
After SMT, in 4933ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 3153 ms.
Support contains 27 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 719/719 transitions.
Graph (complete) has 1138 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 201 /202 variables (removed 1) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 201/202 places, 719/719 transitions.
RANDOM walk for 4000000 steps (86725 resets) in 37926 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1864 resets) in 1037 ms. (385 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1829 resets) in 819 ms. (487 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 954 ms. (418 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 868 ms. (460 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 935 ms. (427 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1802 resets) in 831 ms. (480 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1807 resets) in 957 ms. (417 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1826 resets) in 843 ms. (473 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1789 resets) in 1003 ms. (398 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1840 resets) in 851 ms. (469 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1818 resets) in 767 ms. (520 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1830 resets) in 1005 ms. (397 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (1794 resets) in 931 ms. (429 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1801 resets) in 1018 ms. (392 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1833 resets) in 1008 ms. (396 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1877 resets) in 1002 ms. (398 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1007 ms. (396 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1770 resets) in 986 ms. (405 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1831 resets) in 995 ms. (401 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1766 resets) in 846 ms. (472 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 1030 ms. (387 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1826 resets) in 981 ms. (407 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1832 resets) in 967 ms. (413 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1850 resets) in 788 ms. (506 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1792 resets) in 979 ms. (408 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 857 ms. (466 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1801 resets) in 951 ms. (420 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 6439642 steps, run timeout after 66001 ms. (steps per millisecond=97 ) properties seen :0 out of 27
Probabilistic random walk after 6439642 steps, saw 1838529 distinct states, run finished after 66002 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-02 18:51:28] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
// Phase 1: matrix 712 rows 201 cols
[2024-06-02 18:51:28] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 18:51:28] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 712/900 variables, 188/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 13/913 variables, 13/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/913 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 913/913 variables, and 302 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:51:30] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:51:30] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 712/900 variables, 188/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 91/297 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 27/324 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/900 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 13/913 variables, 13/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/913 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 913/913 variables, and 337 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2944 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints]
After SMT, in 4069ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 2211 ms.
Support contains 27 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 719/719 transitions.
Applied a total of 0 rules in 18 ms. Remains 201 /201 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 201/201 places, 719/719 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 719/719 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2024-06-02 18:51:34] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
[2024-06-02 18:51:34] [INFO ] Invariant cache hit.
[2024-06-02 18:51:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 18:51:34] [INFO ] Flow matrix only has 712 transitions (discarded 7 similar events)
[2024-06-02 18:51:34] [INFO ] Invariant cache hit.
[2024-06-02 18:51:34] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 18:51:34] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-02 18:51:35] [INFO ] Redundant transitions in 55 ms returned [311]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 710 sub problems to find dead transitions.
[2024-06-02 18:51:35] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 18:51:35] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 18:51:35] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:51:41] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:51:42] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2024-06-02 18:51:42] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 1 ms to minimize.
[2024-06-02 18:51:42] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:51:43] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2024-06-02 18:51:44] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:51:44] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:51:45] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:51:45] [INFO ] Deduced a trap composed of 153 places in 102 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 711/911 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 91/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 7 (OVERLAPS) 1/912 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/912 variables, and 317 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 711/911 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 91/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 702/1018 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/912 variables, and 1018 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 702/710 constraints, Known Traps: 15/15 constraints]
After SMT, in 61306ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 61314ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/201 places, 718/719 transitions.
Applied a total of 0 rules in 8 ms. Remains 201 /201 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61932 ms. Remains : 201/201 places, 718/719 transitions.
RANDOM walk for 4000000 steps (86628 resets) in 21339 ms. (187 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1866 resets) in 505 ms. (790 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1847 resets) in 496 ms. (804 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1849 resets) in 522 ms. (764 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1854 resets) in 502 ms. (795 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 503 ms. (793 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1789 resets) in 500 ms. (798 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1794 resets) in 497 ms. (803 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 492 ms. (811 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 494 ms. (808 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 532 ms. (750 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1831 resets) in 494 ms. (808 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 491 ms. (813 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1808 resets) in 506 ms. (788 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1792 resets) in 490 ms. (814 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 500 ms. (798 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1805 resets) in 504 ms. (792 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 519 ms. (769 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1836 resets) in 500 ms. (798 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1810 resets) in 503 ms. (793 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1853 resets) in 502 ms. (795 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1863 resets) in 502 ms. (795 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1805 resets) in 502 ms. (795 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1842 resets) in 503 ms. (793 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1791 resets) in 508 ms. (785 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1792 resets) in 508 ms. (785 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1869 resets) in 500 ms. (798 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1808 resets) in 507 ms. (787 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 3206545 steps, run timeout after 30001 ms. (steps per millisecond=106 ) properties seen :0 out of 27
Probabilistic random walk after 3206545 steps, saw 926467 distinct states, run finished after 30002 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-02 18:53:16] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:53:16] [INFO ] Invariant cache hit.
[2024-06-02 18:53:16] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 711/899 variables, 188/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 13/912 variables, 13/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 711/899 variables, 188/202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 91/293 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/899 variables, 27/320 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:53:18] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/899 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/899 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 13/912 variables, 13/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/912 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 334 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints]
After SMT, in 4186ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 4301 ms.
Support contains 27 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Applied a total of 0 rules in 12 ms. Remains 201 /201 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 201/201 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-06-02 18:53:25] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:53:25] [INFO ] Invariant cache hit.
[2024-06-02 18:53:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 18:53:25] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:53:25] [INFO ] Invariant cache hit.
[2024-06-02 18:53:25] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 18:53:25] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-06-02 18:53:25] [INFO ] Redundant transitions in 8 ms returned []
Running 710 sub problems to find dead transitions.
[2024-06-02 18:53:25] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:53:25] [INFO ] Invariant cache hit.
[2024-06-02 18:53:25] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-02 18:53:31] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:53:31] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:53:31] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:53:31] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:53:31] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 1 ms to minimize.
[2024-06-02 18:53:32] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:53:34] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2024-06-02 18:53:34] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 18:53:34] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:53:35] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:53:35] [INFO ] Deduced a trap composed of 153 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 711/911 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 91/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 7 (OVERLAPS) 1/912 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/912 variables, and 317 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 711/911 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 91/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 702/1018 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 911/912 variables, and 1018 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 702/710 constraints, Known Traps: 15/15 constraints]
After SMT, in 61213ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 61219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61768 ms. Remains : 201/201 places, 718/718 transitions.
RANDOM walk for 400000 steps (8680 resets) in 3525 ms. (113 steps per ms) remains 27/27 properties
Running SMT prover for 27 properties.
[2024-06-02 18:54:27] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:54:27] [INFO ] Invariant cache hit.
[2024-06-02 18:54:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 18:54:28] [INFO ] After 165ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27
[2024-06-02 18:54:28] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 18:54:28] [INFO ] After 115ms SMT Verify possible using 91 Read/Feed constraints in real domain returned unsat :0 sat :27
TRAPS : Iteration 0
[2024-06-02 18:54:29] [INFO ] After 1126ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:27
[2024-06-02 18:54:29] [INFO ] After 1385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-06-02 18:54:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:54:29] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-06-02 18:54:29] [INFO ] After 144ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :27
TRAPS : Iteration 0
[2024-06-02 18:54:29] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:54:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-02 18:54:30] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-06-02 18:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 1
[2024-06-02 18:54:31] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2024-06-02 18:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
TRAPS : Iteration 2
[2024-06-02 18:54:32] [INFO ] After 2927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
[2024-06-02 18:54:32] [INFO ] After 3177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
RANDOM walk for 4000000 steps (86695 resets) in 65909 ms. (60 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1822 resets) in 1341 ms. (298 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1802 resets) in 1486 ms. (268 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 1521 ms. (262 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1840 resets) in 1566 ms. (255 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1830 resets) in 1624 ms. (246 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1297 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1787 resets) in 1461 ms. (273 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1840 resets) in 1454 ms. (274 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 1602 ms. (249 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1830 resets) in 1494 ms. (267 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 1544 ms. (258 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1805 resets) in 1150 ms. (347 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 1583 ms. (252 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1853 resets) in 1382 ms. (289 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1795 resets) in 1587 ms. (251 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1838 resets) in 1577 ms. (253 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (1803 resets) in 1563 ms. (255 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1797 resets) in 1629 ms. (245 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1837 resets) in 1456 ms. (274 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1854 resets) in 1655 ms. (241 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 1510 ms. (264 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1853 resets) in 1477 ms. (270 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (1806 resets) in 1628 ms. (245 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (1845 resets) in 1462 ms. (273 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1834 resets) in 1438 ms. (277 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 1671 ms. (239 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (1819 resets) in 1558 ms. (256 steps per ms) remains 27/27 properties
Interrupted probabilistic random walk after 9691710 steps, run timeout after 105001 ms. (steps per millisecond=92 ) properties seen :0 out of 27
Probabilistic random walk after 9691710 steps, saw 2758395 distinct states, run finished after 105001 ms. (steps per millisecond=92 ) properties seen :0
[2024-06-02 18:56:52] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 711/899 variables, 188/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 13/912 variables, 13/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 87/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 74/188 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 711/899 variables, 188/202 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/899 variables, 91/293 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/899 variables, 27/320 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:56:54] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/899 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/899 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 13/912 variables, 13/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/912 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 334 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints]
After SMT, in 4277ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 4849 ms.
Support contains 27 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Applied a total of 0 rules in 18 ms. Remains 201 /201 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 201/201 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-06-02 18:57:01] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:57:01] [INFO ] Invariant cache hit.
[2024-06-02 18:57:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:57:01] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:57:01] [INFO ] Invariant cache hit.
[2024-06-02 18:57:02] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 18:57:02] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 18:57:02] [INFO ] Redundant transitions in 6 ms returned []
Running 710 sub problems to find dead transitions.
[2024-06-02 18:57:02] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:57:02] [INFO ] Invariant cache hit.
[2024-06-02 18:57:02] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 710 unsolved
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:57:08] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:57:09] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-06-02 18:57:09] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:57:09] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:57:11] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:57:11] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:57:11] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:57:12] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:57:12] [INFO ] Deduced a trap composed of 153 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 711/911 variables, 200/225 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/911 variables, 91/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 710 unsolved
SMT process timed out in 31102ms, After SMT, problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 31114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31628 ms. Remains : 201/201 places, 718/718 transitions.
RANDOM walk for 400000 steps (8737 resets) in 6668 ms. (59 steps per ms) remains 27/27 properties
Running SMT prover for 27 properties.
[2024-06-02 18:57:35] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:57:35] [INFO ] Invariant cache hit.
[2024-06-02 18:57:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:35] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27
[2024-06-02 18:57:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 18:57:35] [INFO ] After 119ms SMT Verify possible using 91 Read/Feed constraints in real domain returned unsat :0 sat :27
TRAPS : Iteration 0
[2024-06-02 18:57:36] [INFO ] After 1010ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:27
[2024-06-02 18:57:36] [INFO ] After 1212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2024-06-02 18:57:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:57:36] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2024-06-02 18:57:37] [INFO ] After 137ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :27
TRAPS : Iteration 0
[2024-06-02 18:57:37] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 18:57:37] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2024-06-02 18:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
TRAPS : Iteration 1
[2024-06-02 18:57:38] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-06-02 18:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
TRAPS : Iteration 2
[2024-06-02 18:57:39] [INFO ] After 2820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
[2024-06-02 18:57:39] [INFO ] After 3055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
RANDOM walk for 40000 steps (857 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (185 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1035776 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1035776 steps, saw 297533 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-02 18:57:42] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
[2024-06-02 18:57:42] [INFO ] Invariant cache hit.
[2024-06-02 18:57:42] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 200 transition count 717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 199 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 198 transition count 716
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 198 transition count 716
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 196 transition count 714
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 194 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 194 transition count 712
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 685
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 659
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 181 transition count 659
Applied a total of 40 rules in 54 ms. Remains 181 /201 variables (removed 20) and now considering 659/718 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 181/201 places, 659/718 transitions.
RANDOM walk for 40000 steps (851 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (179 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1227570 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1227570 steps, saw 294319 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-02 18:57:46] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
// Phase 1: matrix 652 rows 181 cols
[2024-06-02 18:57:46] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:57:46] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 652/821 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 86/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/833 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/833 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:57:46] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 652/821 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 86/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/833 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 659/659 transitions.
Applied a total of 0 rules in 7 ms. Remains 181 /181 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 181/181 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 659/659 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2024-06-02 18:57:47] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 18:57:47] [INFO ] Invariant cache hit.
[2024-06-02 18:57:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:57:47] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 18:57:47] [INFO ] Invariant cache hit.
[2024-06-02 18:57:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 18:57:47] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-02 18:57:47] [INFO ] Redundant transitions in 11 ms returned []
Running 651 sub problems to find dead transitions.
[2024-06-02 18:57:47] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 18:57:47] [INFO ] Invariant cache hit.
[2024-06-02 18:57:47] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-02 18:57:52] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:57:52] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
[2024-06-02 18:57:52] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2024-06-02 18:57:52] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:57:53] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:57:53] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2024-06-02 18:57:53] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 1 ms to minimize.
[2024-06-02 18:57:53] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:57:54] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-06-02 18:57:55] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:57:55] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 2 ms to minimize.
[2024-06-02 18:57:56] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-02 18:57:59] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (OVERLAPS) 652/833 variables, 181/204 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)timeout
(s109 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/833 variables, and 290 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 652/833 variables, 181/204 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 86/290 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 651/941 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-02 18:58:34] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 942 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 14/14 constraints]
After SMT, in 60902ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 60909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61465 ms. Remains : 181/181 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 488
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 488
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 149 transition count 472
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 1 with 1 rules applied. Total rules applied 25 place count 149 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 148 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 148 transition count 465
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 148 transition count 459
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 142 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 142 transition count 442
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 142 transition count 438
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 138 transition count 437
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 138 transition count 437
Applied a total of 74 rules in 35 ms. Remains 138 /181 variables (removed 43) and now considering 437/659 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:58:48] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 138 cols
[2024-06-02 18:58:48] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:58:48] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:58:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:58:48] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:58:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 18:58:48] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:58:48] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:58:48] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
RANDOM walk for 40000 steps (875 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (170 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 994831 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 994831 steps, saw 285632 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
[2024-06-02 18:58:51] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 18:58:51] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 18:58:51] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:58:52] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:58:52] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 196 transition count 714
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 195 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 195 transition count 713
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 193 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 709
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 700
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 689
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 665
Applied a total of 39 rules in 53 ms. Remains 181 /201 variables (removed 20) and now considering 665/718 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 181/201 places, 665/718 transitions.
RANDOM walk for 40000 steps (860 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1168425 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 1
Probabilistic random walk after 1168425 steps, saw 281669 distinct states, run finished after 3001 ms. (steps per millisecond=389 ) properties seen :0
[2024-06-02 18:58:55] [INFO ] Flow matrix only has 658 transitions (discarded 7 similar events)
// Phase 1: matrix 658 rows 181 cols
[2024-06-02 18:58:55] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 18:58:55] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 658/827 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 87/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/839 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/839 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:58:56] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-06-02 18:58:56] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:58:56] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 658/827 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 87/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/827 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/827 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/839 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/839 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 665/665 transitions.
Applied a total of 0 rules in 8 ms. Remains 181 /181 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 665/665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 665/665 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2024-06-02 18:58:56] [INFO ] Flow matrix only has 658 transitions (discarded 7 similar events)
[2024-06-02 18:58:56] [INFO ] Invariant cache hit.
[2024-06-02 18:58:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:58:56] [INFO ] Flow matrix only has 658 transitions (discarded 7 similar events)
[2024-06-02 18:58:56] [INFO ] Invariant cache hit.
[2024-06-02 18:58:56] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 18:58:56] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-06-02 18:58:56] [INFO ] Redundant transitions in 11 ms returned []
Running 657 sub problems to find dead transitions.
[2024-06-02 18:58:56] [INFO ] Flow matrix only has 658 transitions (discarded 7 similar events)
[2024-06-02 18:58:56] [INFO ] Invariant cache hit.
[2024-06-02 18:58:56] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:59:02] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:59:03] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:59:03] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:59:03] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:59:03] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:59:05] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:59:05] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:59:06] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-06-02 18:59:08] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:59:09] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 657 unsolved
[2024-06-02 18:59:13] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 6 (OVERLAPS) 658/839 variables, 181/208 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 87/295 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 839/839 variables, and 295 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 657 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 4 (OVERLAPS) 658/839 variables, 181/208 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/839 variables, 87/295 constraints. Problems are: Problem set: 0 solved, 657 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 657/952 constraints. Problems are: Problem set: 0 solved, 657 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/839 variables, and 952 constraints, problems are : Problem set: 0 solved, 657 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 657/657 constraints, Known Traps: 17/17 constraints]
After SMT, in 60930ms problems are : Problem set: 0 solved, 657 unsolved
Search for dead transitions found 0 dead transitions in 60936ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61460 ms. Remains : 181/181 places, 665/665 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 494
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 150 transition count 489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 149 transition count 488
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 149 transition count 478
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 1 with 1 rules applied. Total rules applied 25 place count 149 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 148 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 148 transition count 471
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 148 transition count 465
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 142 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 142 transition count 448
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 142 transition count 444
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 138 transition count 443
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 76 place count 138 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 138 transition count 442
Applied a total of 77 rules in 34 ms. Remains 138 /181 variables (removed 43) and now considering 442/665 (removed 223) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:59:57] [INFO ] Flow matrix only has 438 transitions (discarded 4 similar events)
// Phase 1: matrix 438 rows 138 cols
[2024-06-02 18:59:57] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 18:59:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:59:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 18:59:58] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:59:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 18:59:58] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:59:58] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:59:58] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 231 ms.
RANDOM walk for 40000 steps (888 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1030667 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 1
Probabilistic random walk after 1030667 steps, saw 295861 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2024-06-02 19:00:01] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:00:01] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:00:01] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:00:01] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/898 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/912 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 194 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 194 transition count 712
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 192 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 192 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 191 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 191 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 685
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 659
Applied a total of 39 rules in 45 ms. Remains 181 /201 variables (removed 20) and now considering 659/718 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 181/201 places, 659/718 transitions.
RANDOM walk for 40000 steps (840 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1230273 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1230273 steps, saw 294777 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-02 19:00:05] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
// Phase 1: matrix 652 rows 181 cols
[2024-06-02 19:00:05] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:00:05] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 652/821 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 86/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/833 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/833 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:00:05] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 652/821 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 86/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/833 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 659/659 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 181/181 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 659/659 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2024-06-02 19:00:05] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 19:00:05] [INFO ] Invariant cache hit.
[2024-06-02 19:00:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:00:05] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 19:00:05] [INFO ] Invariant cache hit.
[2024-06-02 19:00:05] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:00:06] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-06-02 19:00:06] [INFO ] Redundant transitions in 10 ms returned []
Running 651 sub problems to find dead transitions.
[2024-06-02 19:00:06] [INFO ] Flow matrix only has 652 transitions (discarded 7 similar events)
[2024-06-02 19:00:06] [INFO ] Invariant cache hit.
[2024-06-02 19:00:06] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-02 19:00:10] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:00:11] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:00:13] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:00:13] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2024-06-02 19:00:13] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:00:13] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:00:14] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:00:14] [INFO ] Deduced a trap composed of 135 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:00:14] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:00:14] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 652/833 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 86/292 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 7 (OVERLAPS) 0/833 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 651 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 292 constraints, problems are : Problem set: 0 solved, 651 unsolved in 28006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (OVERLAPS) 652/833 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 86/292 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 651/943 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-02 19:00:51] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 1/944 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 944 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 16/16 constraints]
After SMT, in 59006ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 59012ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59510 ms. Remains : 181/181 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 181 vertex of which 35 / 181 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 488
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 488
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 150 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 149 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 149 transition count 472
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 1 with 1 rules applied. Total rules applied 25 place count 149 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 148 transition count 471
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 148 transition count 465
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 148 transition count 459
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 142 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 142 transition count 442
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 142 transition count 438
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 138 transition count 437
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 138 transition count 437
Applied a total of 75 rules in 35 ms. Remains 138 /181 variables (removed 43) and now considering 437/659 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:01:05] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 138 cols
[2024-06-02 19:01:05] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:01:05] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:01:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:01:05] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:01:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:01:05] [INFO ] After 31ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:01:05] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:01:05] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 234 ms.
RANDOM walk for 40000 steps (860 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (189 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982722 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982722 steps, saw 282025 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
[2024-06-02 19:01:08] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:01:08] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:01:08] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:08] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2024-06-02 19:01:08] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:01:08] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 200 transition count 717
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 199 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 192 transition count 716
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 191 transition count 702
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 191 transition count 702
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 190 transition count 700
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 190 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 189 transition count 693
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 188 transition count 691
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 188 transition count 691
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 187 transition count 684
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 187 transition count 684
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 186 transition count 682
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 186 transition count 682
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 185 transition count 675
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 184 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 184 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 183 transition count 666
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 183 transition count 666
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 182 transition count 664
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 181 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 181 transition count 660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 180 transition count 658
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 180 transition count 658
Applied a total of 41 rules in 44 ms. Remains 180 /201 variables (removed 21) and now considering 658/718 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 180/201 places, 658/718 transitions.
RANDOM walk for 40000 steps (878 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (175 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1239672 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :0 out of 1
Probabilistic random walk after 1239672 steps, saw 296529 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :0
[2024-06-02 19:01:12] [INFO ] Flow matrix only has 651 transitions (discarded 7 similar events)
// Phase 1: matrix 651 rows 180 cols
[2024-06-02 19:01:12] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:01:12] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 651/819 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 86/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/819 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/831 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/831 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/831 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 831/831 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:01:12] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:01:12] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 651/819 variables, 168/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/819 variables, 86/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/819 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/831 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/831 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 831/831 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 658/658 transitions.
Applied a total of 0 rules in 6 ms. Remains 180 /180 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 180/180 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 658/658 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2024-06-02 19:01:12] [INFO ] Flow matrix only has 651 transitions (discarded 7 similar events)
[2024-06-02 19:01:12] [INFO ] Invariant cache hit.
[2024-06-02 19:01:12] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:01:12] [INFO ] Flow matrix only has 651 transitions (discarded 7 similar events)
[2024-06-02 19:01:12] [INFO ] Invariant cache hit.
[2024-06-02 19:01:13] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 19:01:13] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-06-02 19:01:13] [INFO ] Redundant transitions in 10 ms returned []
Running 650 sub problems to find dead transitions.
[2024-06-02 19:01:13] [INFO ] Flow matrix only has 651 transitions (discarded 7 similar events)
[2024-06-02 19:01:13] [INFO ] Invariant cache hit.
[2024-06-02 19:01:13] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:01:18] [INFO ] Deduced a trap composed of 134 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:01:20] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:01:20] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:01:20] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:01:21] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:01:21] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:01:21] [INFO ] Deduced a trap composed of 134 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:01:21] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 651/831 variables, 180/205 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 86/291 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (OVERLAPS) 0/831 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 650 unsolved
No progress, stopping.
After SMT solving in domain Real declared 831/831 variables, and 291 constraints, problems are : Problem set: 0 solved, 650 unsolved in 27052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (OVERLAPS) 651/831 variables, 180/205 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 86/291 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 650/941 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/831 variables, and 941 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 15/15 constraints]
After SMT, in 57952ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 57959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58520 ms. Remains : 180/180 places, 658/658 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 180 vertex of which 35 / 180 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 487
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 487
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 149 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 148 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 148 transition count 471
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 1 with 1 rules applied. Total rules applied 25 place count 148 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 147 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 147 transition count 464
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 147 transition count 458
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 141 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 62 place count 141 transition count 440
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 141 transition count 436
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 71 place count 137 transition count 435
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 76 place count 137 transition count 435
Applied a total of 76 rules in 30 ms. Remains 137 /180 variables (removed 43) and now considering 435/658 (removed 223) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:02:11] [INFO ] Flow matrix only has 431 transitions (discarded 4 similar events)
// Phase 1: matrix 431 rows 137 cols
[2024-06-02 19:02:11] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:02:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:02:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:02:11] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:02:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:02:11] [INFO ] After 18ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:02:11] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:02:11] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 212 ms.
RANDOM walk for 40000 steps (879 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (170 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1014973 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1014973 steps, saw 291548 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-06-02 19:02:14] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:02:14] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 19:02:14] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:02:14] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:02:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:02:14] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 190 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 190 transition count 707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 189 transition count 705
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 189 transition count 705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 696
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 696
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 689
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 687
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 687
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 678
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 669
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 663
Applied a total of 43 rules in 42 ms. Remains 179 /201 variables (removed 22) and now considering 663/718 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 179/201 places, 663/718 transitions.
RANDOM walk for 40000 steps (866 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (190 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1189650 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 1
Probabilistic random walk after 1189650 steps, saw 286748 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-06-02 19:02:18] [INFO ] Flow matrix only has 656 transitions (discarded 7 similar events)
// Phase 1: matrix 656 rows 179 cols
[2024-06-02 19:02:18] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:02:18] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 656/823 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 87/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/835 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/835 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:02:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:02:18] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:02:18] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 656/823 variables, 167/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 87/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:02:19] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/835 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/835 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 663/663 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 663/663 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 663/663 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 663/663 transitions.
Applied a total of 0 rules in 6 ms. Remains 179 /179 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2024-06-02 19:02:19] [INFO ] Flow matrix only has 656 transitions (discarded 7 similar events)
[2024-06-02 19:02:19] [INFO ] Invariant cache hit.
[2024-06-02 19:02:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:02:19] [INFO ] Flow matrix only has 656 transitions (discarded 7 similar events)
[2024-06-02 19:02:19] [INFO ] Invariant cache hit.
[2024-06-02 19:02:19] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 19:02:19] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-02 19:02:19] [INFO ] Redundant transitions in 5 ms returned []
Running 655 sub problems to find dead transitions.
[2024-06-02 19:02:19] [INFO ] Flow matrix only has 656 transitions (discarded 7 similar events)
[2024-06-02 19:02:19] [INFO ] Invariant cache hit.
[2024-06-02 19:02:19] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:02:24] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:02:25] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:02:27] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 3 ms to minimize.
[2024-06-02 19:02:27] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:02:28] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:02:28] [INFO ] Deduced a trap composed of 133 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:02:28] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 655 unsolved
[2024-06-02 19:02:32] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (OVERLAPS) 656/835 variables, 179/205 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 87/292 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 8 (OVERLAPS) 0/835 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 655 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 292 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 4 (OVERLAPS) 656/835 variables, 179/205 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 87/292 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 655/947 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/835 variables, and 947 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 16/16 constraints]
After SMT, in 60956ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61490 ms. Remains : 179/179 places, 663/663 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 179 vertex of which 35 / 179 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 492
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 148 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 147 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 147 transition count 476
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 1 with 1 rules applied. Total rules applied 25 place count 147 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 146 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 146 transition count 469
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 146 transition count 463
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 140 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 68 place count 140 transition count 439
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 140 transition count 435
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 77 place count 136 transition count 434
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 82 place count 136 transition count 434
Applied a total of 82 rules in 36 ms. Remains 136 /179 variables (removed 43) and now considering 434/663 (removed 229) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:03:20] [INFO ] Flow matrix only has 430 transitions (discarded 4 similar events)
// Phase 1: matrix 430 rows 136 cols
[2024-06-02 19:03:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:03:20] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:03:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:03:20] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:03:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:03:20] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:03:20] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:03:20] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
RANDOM walk for 40000 steps (882 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 975150 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 1
Probabilistic random walk after 975150 steps, saw 279945 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2024-06-02 19:03:23] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:03:23] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:03:23] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:03:24] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:03:24] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:03:24] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 188 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 188 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 187 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 187 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 675
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 666
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 651
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 649
Applied a total of 45 rules in 51 ms. Remains 178 /201 variables (removed 23) and now considering 649/718 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 178/201 places, 649/718 transitions.
RANDOM walk for 40000 steps (881 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1164674 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :0 out of 1
Probabilistic random walk after 1164674 steps, saw 280675 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :0
[2024-06-02 19:03:27] [INFO ] Flow matrix only has 642 transitions (discarded 7 similar events)
// Phase 1: matrix 642 rows 178 cols
[2024-06-02 19:03:27] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:03:27] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 642/808 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 85/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/820 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/820 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:03:28] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:03:28] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:03:28] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:03:28] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 642/808 variables, 166/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 85/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/808 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/820 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/820 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 178/178 places, 649/649 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 178 /178 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-02 19:03:28] [INFO ] Flow matrix only has 642 transitions (discarded 7 similar events)
[2024-06-02 19:03:28] [INFO ] Invariant cache hit.
[2024-06-02 19:03:28] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:03:28] [INFO ] Flow matrix only has 642 transitions (discarded 7 similar events)
[2024-06-02 19:03:28] [INFO ] Invariant cache hit.
[2024-06-02 19:03:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 19:03:29] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 19:03:29] [INFO ] Redundant transitions in 9 ms returned []
Running 641 sub problems to find dead transitions.
[2024-06-02 19:03:29] [INFO ] Flow matrix only has 642 transitions (discarded 7 similar events)
[2024-06-02 19:03:29] [INFO ] Invariant cache hit.
[2024-06-02 19:03:29] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:03:34] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:03:36] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:03:37] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (OVERLAPS) 642/820 variables, 178/199 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 85/284 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 641 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 284 constraints, problems are : Problem set: 0 solved, 641 unsolved in 27046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-02 19:03:59] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (OVERLAPS) 642/820 variables, 178/200 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 85/285 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 641/926 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 926 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 12/12 constraints]
After SMT, in 57920ms problems are : Problem set: 0 solved, 641 unsolved
Search for dead transitions found 0 dead transitions in 57933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58432 ms. Remains : 178/178 places, 649/649 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 178 vertex of which 35 / 178 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 478
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 147 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 146 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 146 transition count 462
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 1 with 1 rules applied. Total rules applied 25 place count 146 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 145 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 145 transition count 455
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 145 transition count 449
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 139 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 139 transition count 432
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 139 transition count 428
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 135 transition count 427
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 135 transition count 427
Applied a total of 75 rules in 29 ms. Remains 135 /178 variables (removed 43) and now considering 427/649 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:04:27] [INFO ] Flow matrix only has 423 transitions (discarded 4 similar events)
// Phase 1: matrix 423 rows 135 cols
[2024-06-02 19:04:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:04:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:04:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:04:27] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:04:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:04:27] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:04:27] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:04:27] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 210 ms.
RANDOM walk for 40000 steps (870 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1025555 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :0 out of 1
Probabilistic random walk after 1025555 steps, saw 294129 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
[2024-06-02 19:04:30] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:04:30] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:04:30] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:04:30] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 186 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 186 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 185 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 185 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 649
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 649
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 647
Applied a total of 47 rules in 36 ms. Remains 177 /201 variables (removed 24) and now considering 647/718 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 177/201 places, 647/718 transitions.
RANDOM walk for 40000 steps (869 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1210698 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1210698 steps, saw 290987 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2024-06-02 19:04:34] [INFO ] Flow matrix only has 640 transitions (discarded 7 similar events)
// Phase 1: matrix 640 rows 177 cols
[2024-06-02 19:04:34] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:04:34] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 640/805 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 85/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/817 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/817 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/817 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:04:34] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 640/805 variables, 165/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 85/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/805 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/817 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/817 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/817 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 817/817 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 647/647 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 647/647 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 177/177 places, 647/647 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 647/647 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 647/647 (removed 0) transitions.
[2024-06-02 19:04:34] [INFO ] Flow matrix only has 640 transitions (discarded 7 similar events)
[2024-06-02 19:04:34] [INFO ] Invariant cache hit.
[2024-06-02 19:04:35] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 19:04:35] [INFO ] Flow matrix only has 640 transitions (discarded 7 similar events)
[2024-06-02 19:04:35] [INFO ] Invariant cache hit.
[2024-06-02 19:04:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-02 19:04:35] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-02 19:04:35] [INFO ] Redundant transitions in 10 ms returned []
Running 639 sub problems to find dead transitions.
[2024-06-02 19:04:35] [INFO ] Flow matrix only has 640 transitions (discarded 7 similar events)
[2024-06-02 19:04:35] [INFO ] Invariant cache hit.
[2024-06-02 19:04:35] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:04:41] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:04:43] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:04:44] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 640/817 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 85/285 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (OVERLAPS) 0/817 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 639 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 285 constraints, problems are : Problem set: 0 solved, 639 unsolved in 26768 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (OVERLAPS) 640/817 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 85/285 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 639/924 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-02 19:05:27] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 1/925 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/817 variables, and 925 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 14/14 constraints]
After SMT, in 57594ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 57599ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58094 ms. Remains : 177/177 places, 647/647 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 177 vertex of which 35 / 177 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 476
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 476
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 146 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 145 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 145 transition count 460
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 1 with 1 rules applied. Total rules applied 25 place count 145 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 144 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 144 transition count 453
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 144 transition count 447
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 138 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 138 transition count 430
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 138 transition count 426
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 134 transition count 425
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 134 transition count 425
Applied a total of 75 rules in 31 ms. Remains 134 /177 variables (removed 43) and now considering 425/647 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:05:33] [INFO ] Flow matrix only has 421 transitions (discarded 4 similar events)
// Phase 1: matrix 421 rows 134 cols
[2024-06-02 19:05:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:05:33] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:05:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:05:33] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:05:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:05:33] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:05:33] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:05:33] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
RANDOM walk for 40000 steps (853 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (179 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 988801 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 1
Probabilistic random walk after 988801 steps, saw 284008 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
[2024-06-02 19:05:36] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:05:36] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:05:36] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:05:36] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:05:36] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:05:36] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 184 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 184 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 183 transition count 666
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 183 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 646
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 646
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 642
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 640
Applied a total of 49 rules in 44 ms. Remains 176 /201 variables (removed 25) and now considering 640/718 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 176/201 places, 640/718 transitions.
RANDOM walk for 40000 steps (862 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (177 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1271683 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1271683 steps, saw 306297 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
[2024-06-02 19:05:40] [INFO ] Flow matrix only has 633 transitions (discarded 7 similar events)
// Phase 1: matrix 633 rows 176 cols
[2024-06-02 19:05:40] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:05:40] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 633/797 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 84/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/809 variables, 12/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/809 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/809 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:05:40] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 633/797 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 84/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/797 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/809 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/809 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/809 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 809/809 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 640/640 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 640/640 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 176/176 places, 640/640 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 640/640 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-02 19:05:40] [INFO ] Flow matrix only has 633 transitions (discarded 7 similar events)
[2024-06-02 19:05:40] [INFO ] Invariant cache hit.
[2024-06-02 19:05:40] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:05:40] [INFO ] Flow matrix only has 633 transitions (discarded 7 similar events)
[2024-06-02 19:05:40] [INFO ] Invariant cache hit.
[2024-06-02 19:05:41] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:05:41] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-06-02 19:05:41] [INFO ] Redundant transitions in 7 ms returned []
Running 632 sub problems to find dead transitions.
[2024-06-02 19:05:41] [INFO ] Flow matrix only has 633 transitions (discarded 7 similar events)
[2024-06-02 19:05:41] [INFO ] Invariant cache hit.
[2024-06-02 19:05:41] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:05:46] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 122 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:05:47] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:05:48] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:05:49] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 633/809 variables, 176/198 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 84/282 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 7 (OVERLAPS) 0/809 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 632 unsolved
No progress, stopping.
After SMT solving in domain Real declared 809/809 variables, and 282 constraints, problems are : Problem set: 0 solved, 632 unsolved in 27302 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 4 (OVERLAPS) 633/809 variables, 176/198 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 84/282 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 632/914 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-02 19:06:34] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 915 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 13/13 constraints]
After SMT, in 58160ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 58165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58645 ms. Remains : 176/176 places, 640/640 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 105 edges and 176 vertex of which 35 / 176 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 469
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 145 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 144 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 144 transition count 453
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 1 with 1 rules applied. Total rules applied 25 place count 144 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 143 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 143 transition count 446
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 143 transition count 440
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 137 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 137 transition count 423
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 137 transition count 419
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 133 transition count 418
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 133 transition count 418
Applied a total of 75 rules in 34 ms. Remains 133 /176 variables (removed 43) and now considering 418/640 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:06:39] [INFO ] Flow matrix only has 414 transitions (discarded 4 similar events)
// Phase 1: matrix 414 rows 133 cols
[2024-06-02 19:06:39] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:06:39] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:06:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:06:39] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:06:39] [INFO ] After 17ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:06:39] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:06:39] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
RANDOM walk for 40000 steps (849 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (167 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 973896 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 1
Probabilistic random walk after 973896 steps, saw 279708 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2024-06-02 19:06:42] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:06:42] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:06:42] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 4 ms to minimize.
[2024-06-02 19:06:43] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 805ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 182 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 182 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 181 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 181 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 646
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 646
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 638
Applied a total of 51 rules in 49 ms. Remains 175 /201 variables (removed 26) and now considering 638/718 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 175/201 places, 638/718 transitions.
RANDOM walk for 40000 steps (853 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (166 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1188663 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 1
Probabilistic random walk after 1188663 steps, saw 286503 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-06-02 19:06:46] [INFO ] Flow matrix only has 631 transitions (discarded 7 similar events)
// Phase 1: matrix 631 rows 175 cols
[2024-06-02 19:06:46] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:06:46] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 631/794 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 84/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/806 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/806 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/806 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:06:47] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 631/794 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 84/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/806 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/806 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/806 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 806/806 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 638/638 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 175/175 places, 638/638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 638/638 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 631 transitions (discarded 7 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 631 transitions (discarded 7 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:06:47] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-02 19:06:47] [INFO ] Redundant transitions in 9 ms returned []
Running 630 sub problems to find dead transitions.
[2024-06-02 19:06:47] [INFO ] Flow matrix only has 631 transitions (discarded 7 similar events)
[2024-06-02 19:06:47] [INFO ] Invariant cache hit.
[2024-06-02 19:06:47] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:06:52] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:06:53] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:06:54] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:06:55] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/806 variables, 175/196 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 84/280 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 7 (OVERLAPS) 0/806 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 630 unsolved
No progress, stopping.
After SMT solving in domain Real declared 806/806 variables, and 280 constraints, problems are : Problem set: 0 solved, 630 unsolved in 25423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/806 variables, 175/196 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 84/280 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 630/910 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/806 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 910 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 11/11 constraints]
After SMT, in 56234ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 56239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56718 ms. Remains : 175/175 places, 638/638 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 105 edges and 175 vertex of which 35 / 175 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 144 transition count 467
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 144 transition count 467
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 144 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 143 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 143 transition count 451
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 1 with 1 rules applied. Total rules applied 25 place count 143 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 142 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 142 transition count 444
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 142 transition count 438
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 136 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 136 transition count 421
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 136 transition count 417
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 132 transition count 416
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 132 transition count 416
Applied a total of 75 rules in 27 ms. Remains 132 /175 variables (removed 43) and now considering 416/638 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:07:44] [INFO ] Flow matrix only has 412 transitions (discarded 4 similar events)
// Phase 1: matrix 412 rows 132 cols
[2024-06-02 19:07:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:07:44] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:07:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:07:44] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:07:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:07:44] [INFO ] After 22ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:07:44] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:07:44] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 242 ms.
RANDOM walk for 40000 steps (846 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1034557 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :0 out of 1
Probabilistic random walk after 1034557 steps, saw 297066 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
[2024-06-02 19:07:47] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:07:47] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:07:47] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:07:47] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:07:47] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:07:47] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 180 transition count 655
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 180 transition count 655
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 179 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 179 transition count 648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 646
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 646
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 639
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 633
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 631
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 631
Applied a total of 53 rules in 34 ms. Remains 174 /201 variables (removed 27) and now considering 631/718 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 174/201 places, 631/718 transitions.
RANDOM walk for 40000 steps (880 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (177 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1280658 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :0 out of 1
Probabilistic random walk after 1280658 steps, saw 309175 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
[2024-06-02 19:07:51] [INFO ] Flow matrix only has 624 transitions (discarded 7 similar events)
// Phase 1: matrix 624 rows 174 cols
[2024-06-02 19:07:51] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:07:51] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 624/786 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 83/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/798 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/798 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:07:51] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 624/786 variables, 162/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 83/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/798 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/798 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 798/798 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 484ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 631/631 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 631/631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 174/174 places, 631/631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 631/631 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2024-06-02 19:07:51] [INFO ] Flow matrix only has 624 transitions (discarded 7 similar events)
[2024-06-02 19:07:51] [INFO ] Invariant cache hit.
[2024-06-02 19:07:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 19:07:51] [INFO ] Flow matrix only has 624 transitions (discarded 7 similar events)
[2024-06-02 19:07:51] [INFO ] Invariant cache hit.
[2024-06-02 19:07:51] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-02 19:07:52] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-06-02 19:07:52] [INFO ] Redundant transitions in 4 ms returned []
Running 623 sub problems to find dead transitions.
[2024-06-02 19:07:52] [INFO ] Flow matrix only has 624 transitions (discarded 7 similar events)
[2024-06-02 19:07:52] [INFO ] Invariant cache hit.
[2024-06-02 19:07:52] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 623 unsolved
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:07:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:07:57] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:07:57] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:07:57] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:07:57] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:07:57] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:07:59] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:07:59] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:07:59] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/798 variables, 174/198 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 83/281 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 7 (OVERLAPS) 0/798 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 623 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 281 constraints, problems are : Problem set: 0 solved, 623 unsolved in 26045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/798 variables, 174/198 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 83/281 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 623/904 constraints. Problems are: Problem set: 0 solved, 623 unsolved
[2024-06-02 19:08:44] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/798 variables, and 905 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 15/15 constraints]
After SMT, in 56878ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 56883ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57428 ms. Remains : 174/174 places, 631/631 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 104 edges and 174 vertex of which 35 / 174 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 143 transition count 460
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 143 transition count 460
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 143 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 142 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 142 transition count 444
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 1 with 1 rules applied. Total rules applied 25 place count 142 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 141 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 141 transition count 437
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 141 transition count 431
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 135 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 135 transition count 414
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 135 transition count 410
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 131 transition count 409
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 131 transition count 409
Applied a total of 75 rules in 37 ms. Remains 131 /174 variables (removed 43) and now considering 409/631 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:08:49] [INFO ] Flow matrix only has 405 transitions (discarded 4 similar events)
// Phase 1: matrix 405 rows 131 cols
[2024-06-02 19:08:49] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:08:49] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:08:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 19:08:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:08:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:08:49] [INFO ] After 18ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:08:49] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:08:49] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
RANDOM walk for 40000 steps (877 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (189 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1037966 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :0 out of 1
Probabilistic random walk after 1037966 steps, saw 298024 distinct states, run finished after 3001 ms. (steps per millisecond=345 ) properties seen :0
[2024-06-02 19:08:52] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:08:52] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:08:52] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:08:52] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:08:52] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:08:52] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:08:52] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 809ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 653
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 178 transition count 646
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 178 transition count 646
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 177 transition count 644
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 177 transition count 644
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 635
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 631
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 631
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 629
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 629
Applied a total of 55 rules in 38 ms. Remains 173 /201 variables (removed 28) and now considering 629/718 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 173/201 places, 629/718 transitions.
RANDOM walk for 40000 steps (847 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (199 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1248221 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1248221 steps, saw 298557 distinct states, run finished after 3001 ms. (steps per millisecond=415 ) properties seen :0
[2024-06-02 19:08:56] [INFO ] Flow matrix only has 622 transitions (discarded 7 similar events)
// Phase 1: matrix 622 rows 173 cols
[2024-06-02 19:08:56] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:08:56] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/783 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 83/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/795 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/795 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/795 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 622/783 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 83/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/783 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/795 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/795 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/795 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 795/795 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 629/629 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 629/629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 173/173 places, 629/629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 629/629 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 629/629 (removed 0) transitions.
[2024-06-02 19:08:56] [INFO ] Flow matrix only has 622 transitions (discarded 7 similar events)
[2024-06-02 19:08:56] [INFO ] Invariant cache hit.
[2024-06-02 19:08:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 19:08:56] [INFO ] Flow matrix only has 622 transitions (discarded 7 similar events)
[2024-06-02 19:08:56] [INFO ] Invariant cache hit.
[2024-06-02 19:08:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-02 19:08:57] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-02 19:08:57] [INFO ] Redundant transitions in 7 ms returned []
Running 621 sub problems to find dead transitions.
[2024-06-02 19:08:57] [INFO ] Flow matrix only has 622 transitions (discarded 7 similar events)
[2024-06-02 19:08:57] [INFO ] Invariant cache hit.
[2024-06-02 19:08:57] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:09:01] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:09:02] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:09:02] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:09:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:09:03] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:09:04] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 19:09:07] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2024-06-02 19:09:07] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (OVERLAPS) 622/795 variables, 173/196 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 83/279 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 8 (OVERLAPS) 0/795 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 621 unsolved
No progress, stopping.
After SMT solving in domain Real declared 795/795 variables, and 279 constraints, problems are : Problem set: 0 solved, 621 unsolved in 27685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/795 variables, 173/196 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/795 variables, 83/279 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/795 variables, 621/900 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/795 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 795/795 variables, and 900 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 13/13 constraints]
After SMT, in 58469ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 58474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58954 ms. Remains : 173/173 places, 629/629 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 104 edges and 173 vertex of which 35 / 173 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 142 transition count 458
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 142 transition count 458
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 142 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 141 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 141 transition count 442
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 1 with 1 rules applied. Total rules applied 25 place count 141 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 140 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 140 transition count 435
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 140 transition count 429
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 134 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 134 transition count 412
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 134 transition count 408
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 130 transition count 407
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 130 transition count 407
Applied a total of 75 rules in 28 ms. Remains 130 /173 variables (removed 43) and now considering 407/629 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:09:55] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 130 cols
[2024-06-02 19:09:55] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:09:55] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:09:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:09:55] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:09:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:09:55] [INFO ] After 19ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:09:55] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:09:55] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 236 ms.
RANDOM walk for 40000 steps (859 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (171 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 969033 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 1
Probabilistic random walk after 969033 steps, saw 278186 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2024-06-02 19:09:58] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:09:58] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:09:58] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:09:59] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 653
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 653
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 177 transition count 639
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 177 transition count 639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 176 transition count 637
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 176 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 175 transition count 630
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 175 transition count 630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 172 transition count 622
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 172 transition count 622
Applied a total of 57 rules in 38 ms. Remains 172 /201 variables (removed 29) and now considering 622/718 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 172/201 places, 622/718 transitions.
RANDOM walk for 40000 steps (876 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (166 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1259567 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1259567 steps, saw 302358 distinct states, run finished after 3002 ms. (steps per millisecond=419 ) properties seen :0
[2024-06-02 19:10:02] [INFO ] Flow matrix only has 615 transitions (discarded 7 similar events)
// Phase 1: matrix 615 rows 172 cols
[2024-06-02 19:10:02] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:10:02] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 615/775 variables, 160/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 82/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/787 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/787 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/787 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 787/787 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:10:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 615/775 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/775 variables, 82/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/775 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/775 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/787 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/787 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/787 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 787/787 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 622/622 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 622/622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 622/622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 622/622 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 622/622 (removed 0) transitions.
[2024-06-02 19:10:03] [INFO ] Flow matrix only has 615 transitions (discarded 7 similar events)
[2024-06-02 19:10:03] [INFO ] Invariant cache hit.
[2024-06-02 19:10:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 19:10:03] [INFO ] Flow matrix only has 615 transitions (discarded 7 similar events)
[2024-06-02 19:10:03] [INFO ] Invariant cache hit.
[2024-06-02 19:10:03] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:10:03] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-06-02 19:10:03] [INFO ] Redundant transitions in 7 ms returned []
Running 614 sub problems to find dead transitions.
[2024-06-02 19:10:03] [INFO ] Flow matrix only has 615 transitions (discarded 7 similar events)
[2024-06-02 19:10:03] [INFO ] Invariant cache hit.
[2024-06-02 19:10:03] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:10:08] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:10:09] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:10:10] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:10:11] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:10:11] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2024-06-02 19:10:14] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (OVERLAPS) 615/787 variables, 172/195 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 82/277 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 8 (OVERLAPS) 0/787 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 614 unsolved
No progress, stopping.
After SMT solving in domain Real declared 787/787 variables, and 277 constraints, problems are : Problem set: 0 solved, 614 unsolved in 27687 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 4 (OVERLAPS) 615/787 variables, 172/195 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/787 variables, 82/277 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 614/891 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 787/787 variables, and 891 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 172/172 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 13/13 constraints]
After SMT, in 58576ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 58584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59067 ms. Remains : 172/172 places, 622/622 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 103 edges and 172 vertex of which 35 / 172 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 141 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 141 transition count 451
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 141 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 140 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 140 transition count 435
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 1 with 1 rules applied. Total rules applied 25 place count 140 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 139 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 139 transition count 428
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 139 transition count 422
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 133 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 133 transition count 405
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 133 transition count 401
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 129 transition count 400
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 129 transition count 400
Applied a total of 75 rules in 26 ms. Remains 129 /172 variables (removed 43) and now considering 400/622 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:11:02] [INFO ] Flow matrix only has 396 transitions (discarded 4 similar events)
// Phase 1: matrix 396 rows 129 cols
[2024-06-02 19:11:02] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:11:02] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:11:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:11:02] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:11:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:11:02] [INFO ] After 26ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:11:02] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:11:02] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 231 ms.
RANDOM walk for 40000 steps (853 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (175 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1043724 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1043724 steps, saw 299516 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-06-02 19:11:05] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:11:05] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:11:05] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 711/898 variables, 187/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/898 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/912 variables, 14/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/187 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:11:05] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:11:05] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:11:05] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 711/898 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 91/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/912 variables, 14/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/912 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 306 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Graph (complete) has 1136 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 200 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 198 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 197 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 197 transition count 715
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 195 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 193 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 193 transition count 711
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 191 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 189 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 189 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 187 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 185 transition count 675
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 185 transition count 675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 183 transition count 671
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 183 transition count 671
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 181 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 181 transition count 657
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 179 transition count 653
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 179 transition count 653
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 177 transition count 639
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 177 transition count 639
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 175 transition count 635
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 175 transition count 635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 174 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 174 transition count 628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 173 transition count 626
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 173 transition count 626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 172 transition count 622
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 172 transition count 622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 171 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 171 transition count 620
Applied a total of 59 rules in 39 ms. Remains 171 /201 variables (removed 30) and now considering 620/718 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 171/201 places, 620/718 transitions.
RANDOM walk for 40000 steps (871 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1295800 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :0 out of 1
Probabilistic random walk after 1295800 steps, saw 313906 distinct states, run finished after 3001 ms. (steps per millisecond=431 ) properties seen :0
[2024-06-02 19:11:09] [INFO ] Flow matrix only has 613 transitions (discarded 7 similar events)
// Phase 1: matrix 613 rows 171 cols
[2024-06-02 19:11:09] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:11:09] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 613/772 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 82/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/784 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/784 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/159 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:11:09] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:11:09] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 613/772 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 82/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/784 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/784 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 620/620 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 620/620 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 171/171 places, 620/620 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 620/620 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2024-06-02 19:11:09] [INFO ] Flow matrix only has 613 transitions (discarded 7 similar events)
[2024-06-02 19:11:09] [INFO ] Invariant cache hit.
[2024-06-02 19:11:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 19:11:09] [INFO ] Flow matrix only has 613 transitions (discarded 7 similar events)
[2024-06-02 19:11:09] [INFO ] Invariant cache hit.
[2024-06-02 19:11:10] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:11:10] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-06-02 19:11:10] [INFO ] Redundant transitions in 10 ms returned []
Running 612 sub problems to find dead transitions.
[2024-06-02 19:11:10] [INFO ] Flow matrix only has 613 transitions (discarded 7 similar events)
[2024-06-02 19:11:10] [INFO ] Invariant cache hit.
[2024-06-02 19:11:10] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 19:11:14] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:11:15] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:11:16] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:11:17] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 4 (OVERLAPS) 613/784 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 82/274 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-02 19:11:23] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 8 (OVERLAPS) 0/784 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 612 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 275 constraints, problems are : Problem set: 0 solved, 612 unsolved in 29168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-02 19:11:42] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 5 (OVERLAPS) 613/784 variables, 171/194 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 82/276 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 612/888 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-02 19:12:06] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 889 constraints, problems are : Problem set: 0 solved, 612 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 612/612 constraints, Known Traps: 14/14 constraints]
After SMT, in 59905ms problems are : Problem set: 0 solved, 612 unsolved
Search for dead transitions found 0 dead transitions in 59910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60364 ms. Remains : 171/171 places, 620/620 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 103 edges and 171 vertex of which 35 / 171 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 149 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 168 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 449
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 140 transition count 444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 139 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 139 transition count 433
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 1 with 1 rules applied. Total rules applied 25 place count 139 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 138 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 138 transition count 426
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 138 transition count 420
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 47 place count 132 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 61 place count 132 transition count 403
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 132 transition count 399
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 70 place count 128 transition count 398
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 75 place count 128 transition count 398
Applied a total of 75 rules in 25 ms. Remains 128 /171 variables (removed 43) and now considering 398/620 (removed 222) transitions.
Running SMT prover for 1 properties.
[2024-06-02 19:12:10] [INFO ] Flow matrix only has 394 transitions (discarded 4 similar events)
// Phase 1: matrix 394 rows 128 cols
[2024-06-02 19:12:10] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:12:10] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 19:12:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 19:12:10] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 19:12:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 19:12:10] [INFO ] After 20ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 19:12:10] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 19:12:10] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 210 ms.
RANDOM walk for 40000 steps (854 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (178 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1016403 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :0 out of 1
Probabilistic random walk after 1016403 steps, saw 291941 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
[2024-06-02 19:12:13] [INFO ] Flow matrix only has 711 transitions (discarded 7 similar events)
// Phase 1: matrix 711 rows 201 cols
[2024-06-02 19:12:13] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:12:13] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 182/210 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 698/908 variables, 192/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/908 variables, 91/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/908 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/912 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/912 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/25 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 182/210 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:12:13] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:12:14] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 698/908 variables, 192/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 91/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:14] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:12:14] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/912 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/912 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/912 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1006ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 718/718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 201 transition count 716
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 199 transition count 716
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 197 transition count 714
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 195 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 195 transition count 712
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 193 transition count 722
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 191 transition count 694
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 191 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 189 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 189 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 187 transition count 676
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 187 transition count 676
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 185 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 185 transition count 672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 183 transition count 658
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 183 transition count 658
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 181 transition count 654
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 181 transition count 654
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 179 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 179 transition count 640
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 177 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 177 transition count 636
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 175 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 175 transition count 622
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 173 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 173 transition count 618
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 171 transition count 610
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 171 transition count 610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 169 transition count 606
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 169 transition count 606
Applied a total of 64 rules in 32 ms. Remains 169 /201 variables (removed 32) and now considering 606/718 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 169/201 places, 606/718 transitions.
RANDOM walk for 40000 steps (855 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (183 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1310299 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1310299 steps, saw 317530 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-06-02 19:12:17] [INFO ] Flow matrix only has 599 transitions (discarded 7 similar events)
// Phase 1: matrix 599 rows 169 cols
[2024-06-02 19:12:17] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:12:17] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/177 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 587/764 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 81/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/768 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/768 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/768 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/24 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/177 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:17] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 587/764 variables, 160/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 81/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:12:18] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/768 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/768 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 606/606 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 606/606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 169/169 places, 606/606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 606/606 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-06-02 19:12:18] [INFO ] Flow matrix only has 599 transitions (discarded 7 similar events)
[2024-06-02 19:12:18] [INFO ] Invariant cache hit.
[2024-06-02 19:12:18] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 19:12:18] [INFO ] Flow matrix only has 599 transitions (discarded 7 similar events)
[2024-06-02 19:12:18] [INFO ] Invariant cache hit.
[2024-06-02 19:12:18] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 19:12:18] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 19:12:18] [INFO ] Redundant transitions in 4 ms returned []
Running 598 sub problems to find dead transitions.
[2024-06-02 19:12:18] [INFO ] Flow matrix only has 599 transitions (discarded 7 similar events)
[2024-06-02 19:12:18] [INFO ] Invariant cache hit.
[2024-06-02 19:12:18] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:12:22] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:12:23] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:12:25] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 19:12:27] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (OVERLAPS) 599/767 variables, 168/188 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 81/269 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 8 (OVERLAPS) 1/768 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 598 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-20, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905900203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;