About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9404.836 | 3600000.00 | 7633253.00 | 5231.20 | FFFFTFFFFTTT?T?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900563.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 itstools
Input is DoubleExponent-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900563
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716394681152
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 16:18:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 16:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:18:02] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-22 16:18:02] [INFO ] Transformed 1064 places.
[2024-05-22 16:18:02] [INFO ] Transformed 998 transitions.
[2024-05-22 16:18:02] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 119 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 16:18:03] [INFO ] Invariants computation overflowed in 151 ms
[2024-05-22 16:18:03] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 16:18:03] [INFO ] Invariants computation overflowed in 80 ms
[2024-05-22 16:18:16] [INFO ] Implicit Places using invariants and state equation in 13125 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13820 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1064 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 179 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:18:17] [INFO ] Invariants computation overflowed in 124 ms
[2024-05-22 16:18:17] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:18:17] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-22 16:18:34] [INFO ] Implicit Places using invariants and state equation in 17154 ms returned []
Implicit Place search using SMT with State Equation took 17568 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1064 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31706 ms. Remains : 1057/1064 places, 997/998 transitions.
Support contains 42 out of 1057 places after structural reductions.
[2024-05-22 16:18:34] [INFO ] Flatten gal took : 99 ms
[2024-05-22 16:18:34] [INFO ] Flatten gal took : 55 ms
[2024-05-22 16:18:34] [INFO ] Input system was already deterministic with 997 transitions.
Support contains 38 out of 1057 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (1302 resets) in 1521 ms. (26 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4000 steps (109 resets) in 137 ms. (28 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (108 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (115 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (114 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (110 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (118 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (110 resets) in 45 ms. (86 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (112 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (111 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (108 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (108 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (113 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (113 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (112 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (106 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (111 resets) in 45 ms. (86 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (114 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (111 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (111 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (118 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 115707 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 21
Probabilistic random walk after 115707 steps, saw 57866 distinct states, run finished after 3004 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:18:38] [INFO ] Invariants computation overflowed in 103 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 95/129 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 421/550 variables, 167/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 689/1239 variables, 354/555 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 499/1738 variables, 295/850 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1738 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 180/1918 variables, 127/977 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1918 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 54/1972 variables, 31/1008 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1972 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 55/2027 variables, 29/1037 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2027 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 24/2051 variables, 17/1054 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2051/2054 variables, and 1054 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5027 ms.
Refiners :[State Equation: 1054/1057 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 95/129 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 421/550 variables, 167/201 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 21/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 689/1239 variables, 354/576 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 499/1738 variables, 295/871 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1738 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 180/1918 variables, 127/998 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1918/2054 variables, and 998 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5010 ms.
Refiners :[State Equation: 977/1057 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 10189ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 206 transitions
Trivial Post-agglo rules discarded 206 transitions
Performed 206 trivial Post agglomeration. Transition count delta: 206
Iterating post reduction 0 with 207 rules applied. Total rules applied 208 place count 1055 transition count 789
Reduce places removed 206 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 223 rules applied. Total rules applied 431 place count 849 transition count 772
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 448 place count 832 transition count 772
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 448 place count 832 transition count 728
Deduced a syphon composed of 44 places in 6 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 536 place count 788 transition count 728
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 10 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 856 place count 628 transition count 568
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 7 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 924 place count 594 transition count 568
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 925 place count 594 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 926 place count 593 transition count 567
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1004 place count 593 transition count 489
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 4 with 78 rules applied. Total rules applied 1082 place count 515 transition count 489
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 5 with 78 rules applied. Total rules applied 1160 place count 515 transition count 489
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1161 place count 514 transition count 488
Applied a total of 1161 rules in 315 ms. Remains 514 /1057 variables (removed 543) and now considering 488/997 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 514/1057 places, 488/997 transitions.
RANDOM walk for 40000 steps (5146 resets) in 514 ms. (77 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (335 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (329 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (324 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (328 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (318 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (343 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (347 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (338 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (341 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (333 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (353 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (334 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (339 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (321 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (336 resets) in 45 ms. (86 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (345 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (330 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (357 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (329 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (324 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (331 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 141662 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 21
Probabilistic random walk after 141662 steps, saw 70863 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 488 rows 514 cols
[2024-05-22 16:18:52] [INFO ] Computed 99 invariants in 58 ms
[2024-05-22 16:18:52] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 376/410 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 97/507 variables, 39/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 0/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/509 variables, 1/97 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/97 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 488/997 variables, 509/606 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/997 variables, 64/670 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/997 variables, 0/670 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 5/1002 variables, 5/675 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 2/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 0/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1002 variables, 0/677 constraints. Problems are: Problem set: 8 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1002/1002 variables, and 677 constraints, problems are : Problem set: 8 solved, 13 unsolved in 5617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 514/514 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 374/399 variables, 53/53 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/53 constraints. Problems are: Problem set: 8 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 108/507 variables, 43/96 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:18:58] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 28 ms to minimize.
[2024-05-22 16:18:59] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 4 ms to minimize.
[2024-05-22 16:18:59] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 4 ms to minimize.
[2024-05-22 16:18:59] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-22 16:18:59] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 4 ms to minimize.
[2024-05-22 16:18:59] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 4 ms to minimize.
[2024-05-22 16:19:00] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:19:00] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:19:00] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 4 ms to minimize.
[2024-05-22 16:19:00] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 4 ms to minimize.
[2024-05-22 16:19:00] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 4 ms to minimize.
[2024-05-22 16:19:01] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 4 ms to minimize.
[2024-05-22 16:19:01] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:19:01] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 3 ms to minimize.
[2024-05-22 16:19:01] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 4 ms to minimize.
[2024-05-22 16:19:01] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:02] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-22 16:19:02] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:02] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 3 ms to minimize.
[2024-05-22 16:19:02] [INFO ] Deduced a trap composed of 144 places in 186 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:02] [INFO ] Deduced a trap composed of 161 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:03] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:19:03] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:19:03] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 3 ms to minimize.
[2024-05-22 16:19:03] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-05-22 16:19:03] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 4 ms to minimize.
[2024-05-22 16:19:04] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 3 ms to minimize.
[2024-05-22 16:19:04] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:19:04] [INFO ] Deduced a trap composed of 148 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:19:04] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 4 ms to minimize.
[2024-05-22 16:19:04] [INFO ] Deduced a trap composed of 150 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:05] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 5 ms to minimize.
[2024-05-22 16:19:05] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:19:05] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 4 ms to minimize.
[2024-05-22 16:19:05] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 6 ms to minimize.
[2024-05-22 16:19:05] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 4 ms to minimize.
[2024-05-22 16:19:06] [INFO ] Deduced a trap composed of 128 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:06] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 5 ms to minimize.
[2024-05-22 16:19:06] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:19:06] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/136 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:06] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 4 ms to minimize.
[2024-05-22 16:19:07] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 3 ms to minimize.
[2024-05-22 16:19:07] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 4 ms to minimize.
[2024-05-22 16:19:07] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:19:07] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:19:07] [INFO ] Deduced a trap composed of 132 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:08] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 3 ms to minimize.
[2024-05-22 16:19:08] [INFO ] Deduced a trap composed of 137 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:08] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:08] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:08] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 7 ms to minimize.
[2024-05-22 16:19:09] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:19:09] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:09] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:09] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:19:09] [INFO ] Deduced a trap composed of 157 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:19:10] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 4 ms to minimize.
[2024-05-22 16:19:10] [INFO ] Deduced a trap composed of 140 places in 189 ms of which 3 ms to minimize.
[2024-05-22 16:19:10] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:10] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/156 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:10] [INFO ] Deduced a trap composed of 137 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:19:11] [INFO ] Deduced a trap composed of 144 places in 190 ms of which 3 ms to minimize.
[2024-05-22 16:19:11] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:11] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 4 ms to minimize.
[2024-05-22 16:19:11] [INFO ] Deduced a trap composed of 134 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 146 places in 188 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:12] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:19:13] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 4 ms to minimize.
[2024-05-22 16:19:13] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:13] [INFO ] Deduced a trap composed of 128 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:19:13] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:13] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:14] [INFO ] Deduced a trap composed of 130 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:19:14] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:14] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:14] [INFO ] Deduced a trap composed of 122 places in 181 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 20/176 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:14] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:15] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:15] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:15] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:19:15] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:15] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:16] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:16] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:16] [INFO ] Deduced a trap composed of 135 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:16] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:16] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:19:17] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:17] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:17] [INFO ] Deduced a trap composed of 141 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:17] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:19:17] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-22 16:19:18] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:19:18] [INFO ] Deduced a trap composed of 133 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:19:18] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:18] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 20/196 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:18] [INFO ] Deduced a trap composed of 124 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:19] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:19] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:19] [INFO ] Deduced a trap composed of 101 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:19] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:19] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:20] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:20] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 4 ms to minimize.
[2024-05-22 16:19:20] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:20] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:20] [INFO ] Deduced a trap composed of 142 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 124 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:21] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:19:22] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:22] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:19:22] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 20/216 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:22] [INFO ] Deduced a trap composed of 103 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:19:22] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:23] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:23] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:23] [INFO ] Deduced a trap composed of 130 places in 186 ms of which 5 ms to minimize.
[2024-05-22 16:19:23] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:23] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:24] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:19:24] [INFO ] Deduced a trap composed of 143 places in 179 ms of which 4 ms to minimize.
[2024-05-22 16:19:24] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:19:24] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-05-22 16:19:24] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 157 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:25] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:26] [INFO ] Deduced a trap composed of 145 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:26] [INFO ] Deduced a trap composed of 143 places in 175 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 20/236 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:26] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:26] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 128 places in 180 ms of which 4 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 4 ms to minimize.
[2024-05-22 16:19:27] [INFO ] Deduced a trap composed of 123 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:28] [INFO ] Deduced a trap composed of 124 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:19:28] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:19:28] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:28] [INFO ] Deduced a trap composed of 145 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:28] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 134 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 4 ms to minimize.
[2024-05-22 16:19:29] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:19:30] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 20/256 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:30] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2024-05-22 16:19:30] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:19:30] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:30] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:19:31] [INFO ] Deduced a trap composed of 134 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:31] [INFO ] Deduced a trap composed of 103 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:19:31] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:31] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:19:31] [INFO ] Deduced a trap composed of 149 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:19:32] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:19:33] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
[2024-05-22 16:19:33] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:19:33] [INFO ] Deduced a trap composed of 124 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:33] [INFO ] Deduced a trap composed of 117 places in 195 ms of which 3 ms to minimize.
[2024-05-22 16:19:33] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 20/276 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:34] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:19:34] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:19:34] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:19:34] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:34] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:19:35] [INFO ] Deduced a trap composed of 113 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:35] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:19:35] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 4 ms to minimize.
[2024-05-22 16:19:35] [INFO ] Deduced a trap composed of 127 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:35] [INFO ] Deduced a trap composed of 129 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 144 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:36] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:19:37] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:19:37] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:37] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:37] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 20/296 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:37] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:19:38] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:19:38] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:19:38] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:38] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:38] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:39] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:39] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:19:39] [INFO ] Deduced a trap composed of 148 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:19:39] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:19:39] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:40] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:19:40] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 16:19:40] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 2 ms to minimize.
[2024-05-22 16:19:40] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:40] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:19:41] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:19:41] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:19:41] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:19:41] [INFO ] Deduced a trap composed of 155 places in 175 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 20/316 constraints. Problems are: Problem set: 8 solved, 13 unsolved
[2024-05-22 16:19:41] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:19:42] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 4 ms to minimize.
[2024-05-22 16:19:42] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:19:42] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:19:42] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:19:42] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:43] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:19:43] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:19:43] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 50754ms, After SMT, problems are : Problem set: 8 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 488/488 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 514 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 513 transition count 487
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 513 transition count 486
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 512 transition count 486
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 508 transition count 482
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 506 transition count 482
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 506 transition count 478
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 502 transition count 478
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 502 transition count 478
Applied a total of 27 rules in 124 ms. Remains 502 /514 variables (removed 12) and now considering 478/488 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 502/514 places, 478/488 transitions.
RANDOM walk for 40000 steps (5060 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3380 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3372 resets) in 242 ms. (164 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3394 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3348 resets) in 108 ms. (366 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3446 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3468 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (3391 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3337 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3351 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (3326 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 195282 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 13
Probabilistic random walk after 195282 steps, saw 97684 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 478 rows 502 cols
[2024-05-22 16:19:47] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-22 16:19:47] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 104/129 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 488/617 variables, 201/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 36/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 348/965 variables, 262/526 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 30/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 15/980 variables, 14/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/980 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 570 constraints, problems are : Problem set: 0 solved, 13 unsolved in 8468 ms.
Refiners :[State Equation: 502/502 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 104/129 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 488/617 variables, 201/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/617 variables, 36/264 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/617 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 348/965 variables, 262/539 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 30/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 15/980 variables, 14/583 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:03] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 144 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-22 16:20:04] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:20:05] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:20:06] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:20:06] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-22 16:20:06] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 16:20:06] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-22 16:20:06] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:20:07] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 7 ms to minimize.
[2024-05-22 16:20:07] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 20/603 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:08] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:20:09] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:20:09] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:20:09] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 2 ms to minimize.
[2024-05-22 16:20:10] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:20:10] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:20:10] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:20:10] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 2 ms to minimize.
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 2 ms to minimize.
[2024-05-22 16:20:11] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:20:12] [INFO ] Deduced a trap composed of 153 places in 172 ms of which 2 ms to minimize.
[2024-05-22 16:20:12] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:20:12] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:20:12] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:20:13] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:20:13] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:20:13] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 20/623 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:14] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 169 places in 185 ms of which 2 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:20:15] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 155 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:16] [INFO ] Deduced a trap composed of 157 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 159 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:20:17] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 169 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:20:18] [INFO ] Deduced a trap composed of 148 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:20:19] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 2 ms to minimize.
[2024-05-22 16:20:19] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 20/643 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:20] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 138 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 0 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:21] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 149 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:20:22] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 2 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 2 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 153 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 2 ms to minimize.
[2024-05-22 16:20:23] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 2 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 150 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 170 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:20:24] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:25] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 20/663 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:32] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:20:35] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 2 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:20:36] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 141 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:20:37] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:38] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:20:39] [INFO ] Deduced a trap composed of 118 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:20:40] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 179 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:20:41] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/980 variables, 20/683 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:20:46] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-05-22 16:20:47] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:20:47] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:20:48] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:20:48] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 2 ms to minimize.
[2024-05-22 16:20:48] [INFO ] Deduced a trap composed of 150 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:20:48] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:20:48] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 2 ms to minimize.
[2024-05-22 16:20:49] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:20:49] [INFO ] Deduced a trap composed of 172 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:20:49] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:20:49] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:20:49] [INFO ] Deduced a trap composed of 163 places in 172 ms of which 2 ms to minimize.
[2024-05-22 16:20:50] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:20:50] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:20:50] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:20:51] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:20:51] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:20:51] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 2 ms to minimize.
[2024-05-22 16:20:51] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/980 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-22 16:21:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-22 16:21:03] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-22 16:21:03] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:21:03] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:21:04] [INFO ] Deduced a trap composed of 145 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:21:04] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 3 ms to minimize.
[2024-05-22 16:21:04] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 3 ms to minimize.
[2024-05-22 16:21:05] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:21:05] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:21:05] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:21:06] [INFO ] Deduced a trap composed of 150 places in 194 ms of which 2 ms to minimize.
[2024-05-22 16:21:06] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:21:06] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 2 ms to minimize.
[2024-05-22 16:21:07] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:21:08] [INFO ] Deduced a trap composed of 130 places in 199 ms of which 3 ms to minimize.
[2024-05-22 16:21:08] [INFO ] Deduced a trap composed of 149 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:21:08] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 2 ms to minimize.
[2024-05-22 16:21:09] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:21:09] [INFO ] Deduced a trap composed of 147 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:21:09] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 20/723 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 723 constraints, problems are : Problem set: 0 solved, 13 unsolved in 75019 ms.
Refiners :[State Equation: 502/502 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 140/140 constraints]
After SMT, in 83586ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 478/478 transitions.
Applied a total of 0 rules in 27 ms. Remains 502 /502 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 502/502 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 478/478 transitions.
Applied a total of 0 rules in 17 ms. Remains 502 /502 variables (removed 0) and now considering 478/478 (removed 0) transitions.
// Phase 1: matrix 478 rows 502 cols
[2024-05-22 16:21:10] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:21:11] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 478 rows 502 cols
[2024-05-22 16:21:11] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:21:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:21:19] [INFO ] Implicit Places using invariants and state equation in 8185 ms returned [42, 48, 69, 74, 96, 101, 121, 127, 148, 153, 154, 182, 203, 210, 217, 233, 238, 262, 293, 299, 322, 328, 351, 356, 377, 384, 405, 407, 412, 433, 439, 463, 468, 472, 493, 500]
[2024-05-22 16:21:19] [INFO ] Actually due to overlaps returned [299, 74, 217, 69, 153, 293]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 8498 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/502 places, 478/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 496 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 494 transition count 476
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 494 transition count 476
Applied a total of 6 rules in 38 ms. Remains 494 /496 variables (removed 2) and now considering 476/478 (removed 2) transitions.
// Phase 1: matrix 476 rows 494 cols
[2024-05-22 16:21:19] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:21:19] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 476 rows 494 cols
[2024-05-22 16:21:19] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:21:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:21:24] [INFO ] Implicit Places using invariants and state equation in 5053 ms returned [42, 48, 94, 99, 119, 125, 146, 151, 179, 200, 207, 228, 233, 257, 314, 320, 343, 348, 369, 376, 397, 399, 404, 425, 431, 455, 460, 464, 485, 492]
[2024-05-22 16:21:24] [INFO ] Actually due to overlaps returned [320, 99, 464, 94, 314, 399]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 5359 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 488/502 places, 476/478 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 473
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 485 transition count 473
Applied a total of 6 rules in 35 ms. Remains 485 /488 variables (removed 3) and now considering 473/476 (removed 3) transitions.
// Phase 1: matrix 473 rows 485 cols
[2024-05-22 16:21:24] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:21:25] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 473 rows 485 cols
[2024-05-22 16:21:25] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:21:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:21:40] [INFO ] Implicit Places using invariants and state equation in 14767 ms returned [42, 48, 116, 122, 143, 148, 176, 197, 204, 225, 230, 254, 337, 342, 363, 370, 391, 397, 418, 424, 448, 453, 476, 483]
[2024-05-22 16:21:40] [INFO ] Actually due to overlaps returned [342, 122, 42, 116, 337, 48]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 15132 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 479/502 places, 473/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 479 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 477 transition count 471
Applied a total of 4 rules in 21 ms. Remains 477 /479 variables (removed 2) and now considering 471/473 (removed 2) transitions.
// Phase 1: matrix 471 rows 477 cols
[2024-05-22 16:21:40] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:21:40] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 471 rows 477 cols
[2024-05-22 16:21:40] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:21:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:21:47] [INFO ] Implicit Places using invariants and state equation in 7028 ms returned [137, 142, 170, 191, 198, 219, 224, 248, 355, 362, 383, 389, 410, 416, 440, 445, 468, 475]
[2024-05-22 16:21:47] [INFO ] Actually due to overlaps returned [362, 142, 137, 355]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 7454 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 473/502 places, 471/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 473 transition count 469
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 471 transition count 469
Applied a total of 4 rules in 38 ms. Remains 471 /473 variables (removed 2) and now considering 469/471 (removed 2) transitions.
// Phase 1: matrix 469 rows 471 cols
[2024-05-22 16:21:47] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:21:47] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 469 rows 471 cols
[2024-05-22 16:21:47] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:21:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:21:54] [INFO ] Implicit Places using invariants and state equation in 6463 ms returned [167, 188, 195, 216, 221, 245, 377, 383, 404, 410, 434, 439, 462, 469]
[2024-05-22 16:21:54] [INFO ] Actually due to overlaps returned [167, 383, 377]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 6733 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 468/502 places, 469/478 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 469
Applied a total of 2 rules in 22 ms. Remains 468 /468 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 468 cols
[2024-05-22 16:21:54] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:21:54] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 469 rows 468 cols
[2024-05-22 16:21:54] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:21:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:22:10] [INFO ] Implicit Places using invariants and state equation in 15600 ms returned [187, 194, 215, 220, 244, 401, 407, 431, 436, 459, 466]
[2024-05-22 16:22:10] [INFO ] Actually due to overlaps returned [194, 407, 187, 401]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 15852 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 464/502 places, 469/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 467
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 467
Applied a total of 4 rules in 25 ms. Remains 462 /464 variables (removed 2) and now considering 467/469 (removed 2) transitions.
// Phase 1: matrix 467 rows 462 cols
[2024-05-22 16:22:10] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:22:10] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 467 rows 462 cols
[2024-05-22 16:22:10] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:22:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:22:27] [INFO ] Implicit Places using invariants and state equation in 17349 ms returned [212, 217, 241, 425, 430, 453, 460]
[2024-05-22 16:22:27] [INFO ] Actually due to overlaps returned [430, 217, 212, 425]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 17610 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/502 places, 467/478 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 458 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 456 transition count 465
Applied a total of 4 rules in 19 ms. Remains 456 /458 variables (removed 2) and now considering 465/467 (removed 2) transitions.
// Phase 1: matrix 465 rows 456 cols
[2024-05-22 16:22:27] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:22:28] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 465 rows 456 cols
[2024-05-22 16:22:28] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 16:22:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:22:39] [INFO ] Implicit Places using invariants and state equation in 11692 ms returned [238, 447, 454]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 11940 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 453/502 places, 465/478 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 464
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 452 transition count 464
Applied a total of 3 rules in 30 ms. Remains 452 /453 variables (removed 1) and now considering 464/465 (removed 1) transitions.
// Phase 1: matrix 464 rows 452 cols
[2024-05-22 16:22:39] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:22:39] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 464 rows 452 cols
[2024-05-22 16:22:40] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:22:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-22 16:22:45] [INFO ] Implicit Places using invariants and state equation in 5003 ms returned []
Implicit Place search using SMT with State Equation took 5251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 452/502 places, 464/478 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 94076 ms. Remains : 452/502 places, 464/478 transitions.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
FORMULA DoubleExponent-PT-020-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 814 transition count 753
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 485 place count 813 transition count 713
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 565 place count 773 transition count 713
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 2 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 925 place count 593 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1001 place count 555 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1002 place count 554 transition count 532
Applied a total of 1002 rules in 123 ms. Remains 554 /1057 variables (removed 503) and now considering 532/997 (removed 465) transitions.
// Phase 1: matrix 532 rows 554 cols
[2024-05-22 16:22:45] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:22:45] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2024-05-22 16:22:45] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:22:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:22:58] [INFO ] Implicit Places using invariants and state equation in 13265 ms returned []
Implicit Place search using SMT with State Equation took 13581 ms to find 0 implicit places.
[2024-05-22 16:22:58] [INFO ] Redundant transitions in 27 ms returned []
Running 531 sub problems to find dead transitions.
// Phase 1: matrix 532 rows 554 cols
[2024-05-22 16:22:58] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:22:58] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 532/1085 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1085 variables, 38/591 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (OVERLAPS) 1/1086 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1086/1086 variables, and 592 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30040 ms.
Refiners :[State Equation: 554/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 532/1085 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1085 variables, 38/591 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 528/1119 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1119 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30032 ms.
Refiners :[State Equation: 553/554 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 528/531 constraints, Known Traps: 0/0 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 554/1057 places, 532/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74046 ms. Remains : 554/1057 places, 532/997 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-02 finished in 74311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 1055 transition count 760
Reduce places removed 235 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 238 rules applied. Total rules applied 474 place count 820 transition count 757
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 477 place count 817 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 477 place count 817 transition count 717
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 557 place count 777 transition count 717
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 2 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 923 place count 594 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 999 place count 556 transition count 534
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 555 transition count 533
Applied a total of 1000 rules in 92 ms. Remains 555 /1057 variables (removed 502) and now considering 533/997 (removed 464) transitions.
// Phase 1: matrix 533 rows 555 cols
[2024-05-22 16:23:59] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 16:23:59] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2024-05-22 16:23:59] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:24:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:24:11] [INFO ] Implicit Places using invariants and state equation in 11998 ms returned []
Implicit Place search using SMT with State Equation took 12303 ms to find 0 implicit places.
[2024-05-22 16:24:11] [INFO ] Redundant transitions in 11 ms returned []
Running 532 sub problems to find dead transitions.
// Phase 1: matrix 533 rows 555 cols
[2024-05-22 16:24:11] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 16:24:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 533/1087 variables, 554/554 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1087 variables, 38/592 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1087 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 532 unsolved
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/1057 places, 533/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42595 ms. Remains : 555/1057 places, 533/997 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-03 finished in 42758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((X(F(p0))&&(p0||X((G(p1) U (p0&&G(p1)))))))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 35 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:24:42] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-22 16:24:42] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:24:42] [INFO ] Invariants computation overflowed in 116 ms
[2024-05-22 16:24:57] [INFO ] Implicit Places using invariants and state equation in 14831 ms returned []
Implicit Place search using SMT with State Equation took 15269 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:24:57] [INFO ] Invariants computation overflowed in 114 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30067 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30031 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Finished structural reductions in LTL mode , in 1 iterations and 75674 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-04 finished in 76627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((p0&&(p1||X(p2)))))&&(p1 U p2))))'
Support contains 5 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 37 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:25:58] [INFO ] Invariants computation overflowed in 120 ms
[2024-05-22 16:25:59] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:25:59] [INFO ] Invariants computation overflowed in 136 ms
[2024-05-22 16:26:14] [INFO ] Implicit Places using invariants and state equation in 15172 ms returned []
Implicit Place search using SMT with State Equation took 15561 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:26:14] [INFO ] Invariants computation overflowed in 113 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30025 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30029 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in LTL mode , in 1 iterations and 75932 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-06
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-06 finished in 76180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p0 U p1))))))'
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 34 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:27:15] [INFO ] Invariants computation overflowed in 120 ms
[2024-05-22 16:27:15] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:27:15] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-22 16:27:32] [INFO ] Implicit Places using invariants and state equation in 16890 ms returned []
Implicit Place search using SMT with State Equation took 17314 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:27:32] [INFO ] Invariants computation overflowed in 105 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30023 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30035 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 77675 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 78396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 39 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:28:33] [INFO ] Invariants computation overflowed in 122 ms
[2024-05-22 16:28:33] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:28:33] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-22 16:28:48] [INFO ] Implicit Places using invariants and state equation in 15129 ms returned []
Implicit Place search using SMT with State Equation took 15543 ms to find 0 implicit places.
Running 996 sub problems to find dead transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:28:49] [INFO ] Invariants computation overflowed in 129 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2053/2054 variables, and 1056 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30028 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 996 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1056 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 1 (OVERLAPS) 997/2053 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 996 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2053 variables, 996/2052 constraints. Problems are: Problem set: 0 solved, 996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2053/2054 variables, and 2052 constraints, problems are : Problem set: 0 solved, 996 unsolved in 30042 ms.
Refiners :[State Equation: 1056/1057 constraints, PredecessorRefiner: 996/996 constraints, Known Traps: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 996 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Finished structural reductions in LTL mode , in 1 iterations and 75929 ms. Remains : 1057/1057 places, 997/997 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-11
Product exploration explored 100000 steps with 3327 reset in 196 ms.
Product exploration explored 100000 steps with 3259 reset in 151 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1325 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1145 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1116 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (1111 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 172482 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 3
Probabilistic random walk after 172482 steps, saw 86256 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:29:53] [INFO ] Invariants computation overflowed in 111 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/83 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 147/230 variables, 62/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 239/469 variables, 111/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 312/781 variables, 159/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/781 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 284/1065 variables, 154/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1065 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 216/1281 variables, 119/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1281 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 185/1466 variables, 97/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1466 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 133/1599 variables, 80/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1599 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 65/1664 variables, 37/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1664 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 57/1721 variables, 30/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1721 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 47/1768 variables, 24/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1768 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 56/1824 variables, 29/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1824 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 47/1871 variables, 24/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1871 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 56/1927 variables, 29/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1927 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 48/1975 variables, 24/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1975 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 59/2034 variables, 31/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2034 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 20/2054 variables, 17/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2054 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 0/2054 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2054/2054 variables, and 1057 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1869 ms.
Refiners :[State Equation: 1057/1057 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/83 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 147/230 variables, 62/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 239/469 variables, 111/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 312/781 variables, 159/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/781 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 284/1065 variables, 154/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1065 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 216/1281 variables, 119/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1281 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 185/1466 variables, 97/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1466 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 133/1599 variables, 80/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1599 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 65/1664 variables, 37/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1664 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 57/1721 variables, 30/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1721 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 47/1768 variables, 24/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1768 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 56/1824 variables, 29/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1824 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 47/1871 variables, 24/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1871 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 56/1927 variables, 29/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1927 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 48/1975 variables, 24/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1975 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 59/2034 variables, 31/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2034 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 20/2054 variables, 17/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:29:59] [INFO ] Deduced a trap composed of 200 places in 193 ms of which 4 ms to minimize.
[2024-05-22 16:29:59] [INFO ] Deduced a trap composed of 203 places in 186 ms of which 3 ms to minimize.
[2024-05-22 16:30:00] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 3 ms to minimize.
[2024-05-22 16:30:00] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 3 ms to minimize.
SMT process timed out in 7056ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 1055 transition count 761
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 475 place count 821 transition count 756
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 816 transition count 715
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 775 transition count 715
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 2 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1077 place count 556 transition count 456
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 1236 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 478 transition count 455
Applied a total of 1237 rules in 98 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 478/1057 places, 455/997 transitions.
RANDOM walk for 40000 steps (5129 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3407 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3415 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3358 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 260110 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 3
Probabilistic random walk after 260110 steps, saw 130110 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:30:03] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 16:30:03] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 517/786 variables, 285/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 49/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 147/933 variables, 122/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 517/786 variables, 285/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 49/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 147/933 variables, 122/539 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
Problem apf0 is UNSAT
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:30:06] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:30:07] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 20/579 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 16:30:08] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 4/583 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:30:09] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/933 variables, 3/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/933 variables, 0/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/933 variables, 0/586 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 586 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5898 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 27/27 constraints]
After SMT, in 6431ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 478/478 places, 455/455 transitions.
RANDOM walk for 40000 steps (5142 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3399 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 291446 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 291446 steps, saw 145813 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:30:43] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:30:43] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 517/786 variables, 285/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 49/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 147/933 variables, 122/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/933 variables, 20/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/933 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 394 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/269 variables, 67/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 517/786 variables, 285/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 49/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 147/933 variables, 122/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/933 variables, 20/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:30:45] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:30:45] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-22 16:30:45] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-22 16:30:45] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:30:46] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:30:46] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-22 16:30:46] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:30:46] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:30:46] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:30:47] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 16/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:30:48] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-22 16:30:48] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 2 ms to minimize.
[2024-05-22 16:30:48] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 109 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:30:49] [INFO ] Deduced a trap composed of 113 places in 83 ms of which 2 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 111 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 2 ms to minimize.
[2024-05-22 16:30:50] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:30:51] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:30:52] [INFO ] Deduced a trap composed of 102 places in 80 ms of which 2 ms to minimize.
[2024-05-22 16:30:52] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:30:52] [INFO ] Deduced a trap composed of 115 places in 84 ms of which 2 ms to minimize.
[2024-05-22 16:30:52] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/933 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:30:52] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/933 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/933 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 108 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:30:53] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:30:54] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-05-22 16:30:57] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:30:57] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:30:58] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:30:58] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:30:59] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:30:59] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:31:00] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:31:00] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:31:00] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:31:00] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:31:00] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:31:01] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:31:01] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/933 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/933 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:02] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:31:02] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:31:02] [INFO ] Deduced a trap composed of 114 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:31:02] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:31:02] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:31:03] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-05-22 16:31:03] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/933 variables, 7/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/933 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:05] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/933 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:06] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:31:06] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:31:06] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/933 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:07] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/933 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/933 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:08] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 2 ms to minimize.
[2024-05-22 16:31:08] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2024-05-22 16:31:09] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/933 variables, 6/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/933 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:11] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 2 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/933 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/933 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:31:12] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/933 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/933 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/933 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 638 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29258 ms.
Refiners :[State Equation: 478/478 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 80/80 constraints]
After SMT, in 29700ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 30000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:31:42] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:31:43] [INFO ] Implicit Places using invariants in 503 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:31:43] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:31:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:32:00] [INFO ] Implicit Places using invariants and state equation in 17260 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 178, 199, 205, 212, 226, 231, 255, 261, 283, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 470, 476]
[2024-05-22 16:32:00] [INFO ] Actually due to overlaps returned [212, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17779 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 475 transition count 454
Applied a total of 2 rules in 23 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:32:00] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:32:01] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:32:01] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:32:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:32:14] [INFO ] Implicit Places using invariants and state equation in 12859 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 177, 198, 204, 223, 228, 252, 258, 280, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 417, 439, 444, 448, 467, 473]
[2024-05-22 16:32:14] [INFO ] Actually due to overlaps returned [448, 387]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13334 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 453
Applied a total of 2 rules in 29 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:32:14] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:32:14] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:32:14] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:32:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:32:34] [INFO ] Implicit Places using invariants and state equation in 19957 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 177, 198, 204, 223, 228, 252, 258, 280, 286, 306, 311, 332, 337, 358, 364, 385, 390, 410, 416, 438, 443, 464, 470]
[2024-05-22 16:32:34] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 20452 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 452
Applied a total of 2 rules in 22 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:32:34] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:32:35] [INFO ] Implicit Places using invariants in 574 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:32:35] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:32:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:32:45] [INFO ] Implicit Places using invariants and state equation in 10758 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 174, 195, 201, 220, 225, 249, 255, 277, 283, 303, 308, 329, 334, 355, 361, 382, 387, 407, 413, 435, 440, 461, 467]
[2024-05-22 16:32:45] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11369 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 451
Applied a total of 2 rules in 19 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:32:45] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:32:46] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:32:46] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:32:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:32:56] [INFO ] Implicit Places using invariants and state equation in 10421 ms returned [88, 93, 113, 119, 140, 145, 171, 192, 198, 217, 222, 246, 252, 274, 280, 300, 305, 326, 331, 352, 358, 379, 384, 404, 410, 432, 437, 458, 464]
[2024-05-22 16:32:56] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10994 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 450
Applied a total of 2 rules in 19 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:32:56] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:32:57] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:32:57] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:32:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:09] [INFO ] Implicit Places using invariants and state equation in 11819 ms returned [110, 116, 137, 142, 168, 189, 195, 214, 219, 243, 249, 271, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 455, 461]
[2024-05-22 16:33:09] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12239 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 449
Applied a total of 2 rules in 22 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:33:09] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:33:09] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:33:09] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:33:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:18] [INFO ] Implicit Places using invariants and state equation in 8848 ms returned [134, 139, 165, 186, 192, 211, 216, 240, 246, 268, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 452, 458]
[2024-05-22 16:33:18] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9253 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 448
Applied a total of 2 rules in 20 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:33:18] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:33:18] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:33:18] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:33:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:36] [INFO ] Implicit Places using invariants and state equation in 17450 ms returned [162, 183, 189, 208, 213, 237, 243, 265, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 449, 455]
[2024-05-22 16:33:36] [INFO ] Actually due to overlaps returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 17828 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 456/478 places, 448/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 448
Applied a total of 1 rules in 15 ms. Remains 456 /456 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 456 cols
[2024-05-22 16:33:36] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:33:36] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 448 rows 456 cols
[2024-05-22 16:33:36] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:33:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:44] [INFO ] Implicit Places using invariants and state equation in 7678 ms returned [182, 188, 207, 212, 236, 242, 264, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 448, 454]
[2024-05-22 16:33:44] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8086 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 454/478 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 454 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 447
Applied a total of 2 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 453 cols
[2024-05-22 16:33:44] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:33:44] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 447 rows 453 cols
[2024-05-22 16:33:44] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:33:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:52] [INFO ] Implicit Places using invariants and state equation in 7801 ms returned [204, 209, 233, 239, 261, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 445, 451]
[2024-05-22 16:33:52] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8143 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 451/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 451 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 446
Applied a total of 2 rules in 16 ms. Remains 450 /451 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 450 cols
[2024-05-22 16:33:52] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:33:52] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 446 rows 450 cols
[2024-05-22 16:33:52] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:33:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:33:59] [INFO ] Implicit Places using invariants and state equation in 6670 ms returned [230, 236, 258, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 442, 448]
[2024-05-22 16:33:59] [INFO ] Actually due to overlaps returned [236, 230]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7019 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 448/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 448 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 445
Applied a total of 2 rules in 16 ms. Remains 447 /448 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 447 cols
[2024-05-22 16:33:59] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:34:00] [INFO ] Implicit Places using invariants in 504 ms returned []
// Phase 1: matrix 445 rows 447 cols
[2024-05-22 16:34:00] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:34:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:08] [INFO ] Implicit Places using invariants and state equation in 8052 ms returned [255, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 439, 445]
[2024-05-22 16:34:08] [INFO ] Actually due to overlaps returned [261, 255]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8569 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 445/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 444
Applied a total of 2 rules in 18 ms. Remains 444 /445 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 444 cols
[2024-05-22 16:34:08] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:34:08] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2024-05-22 16:34:08] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:34:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:16] [INFO ] Implicit Places using invariants and state equation in 7495 ms returned [278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 436, 442]
[2024-05-22 16:34:16] [INFO ] Actually due to overlaps returned [283, 278]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7820 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 442/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 441 transition count 443
Applied a total of 2 rules in 15 ms. Remains 441 /442 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 441 cols
[2024-05-22 16:34:16] [INFO ] Computed 74 invariants in 39 ms
[2024-05-22 16:34:16] [INFO ] Implicit Places using invariants in 549 ms returned [301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 433, 439]
[2024-05-22 16:34:16] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 559 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 439/478 places, 443/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 438 transition count 442
Applied a total of 2 rules in 15 ms. Remains 438 /439 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 438 cols
[2024-05-22 16:34:16] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:16] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 442 rows 438 cols
[2024-05-22 16:34:16] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:34:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:25] [INFO ] Implicit Places using invariants and state equation in 8283 ms returned [324, 330, 351, 356, 376, 382, 404, 409, 430, 436]
[2024-05-22 16:34:25] [INFO ] Actually due to overlaps returned [330, 324]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8607 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 436/478 places, 442/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 436 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 435 transition count 441
Applied a total of 2 rules in 15 ms. Remains 435 /436 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 435 cols
[2024-05-22 16:34:25] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:34:25] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 441 rows 435 cols
[2024-05-22 16:34:25] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:33] [INFO ] Implicit Places using invariants and state equation in 8027 ms returned [348, 353, 373, 379, 401, 406, 427, 433]
[2024-05-22 16:34:33] [INFO ] Actually due to overlaps returned [353, 348]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8332 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 433/478 places, 441/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 15 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 432 cols
[2024-05-22 16:34:33] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:34:33] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2024-05-22 16:34:33] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:34:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:41] [INFO ] Implicit Places using invariants and state equation in 7439 ms returned [370, 376, 398, 403, 424, 430]
[2024-05-22 16:34:41] [INFO ] Actually due to overlaps returned [376, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7760 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 430/478 places, 440/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 430 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 439
Applied a total of 2 rules in 19 ms. Remains 429 /430 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 429 cols
[2024-05-22 16:34:41] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:34:41] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 439 rows 429 cols
[2024-05-22 16:34:41] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:49] [INFO ] Implicit Places using invariants and state equation in 7543 ms returned [395, 400, 421, 427]
[2024-05-22 16:34:49] [INFO ] Actually due to overlaps returned [400, 395]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7838 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 427/478 places, 439/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 427 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 426 transition count 438
Applied a total of 2 rules in 22 ms. Remains 426 /427 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 426 cols
[2024-05-22 16:34:49] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:49] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 438 rows 426 cols
[2024-05-22 16:34:49] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:34:56] [INFO ] Implicit Places using invariants and state equation in 7411 ms returned [418, 424]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7709 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 424/478 places, 438/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 424 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 423 transition count 437
Applied a total of 2 rules in 15 ms. Remains 423 /424 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 423 cols
[2024-05-22 16:34:56] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:34:57] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 437 rows 423 cols
[2024-05-22 16:34:57] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:34:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:35:03] [INFO ] Implicit Places using invariants and state equation in 6638 ms returned []
Implicit Place search using SMT with State Equation took 6925 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 423/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 200979 ms. Remains : 423/478 places, 437/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 42 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-11 finished in 390586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 753
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 485 place count 813 transition count 753
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 485 place count 813 transition count 713
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 565 place count 773 transition count 713
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 2 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 927 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1003 place count 554 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1004 place count 553 transition count 531
Applied a total of 1004 rules in 64 ms. Remains 553 /1057 variables (removed 504) and now considering 531/997 (removed 466) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:35:04] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 16:35:04] [INFO ] Implicit Places using invariants in 581 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:35:04] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:35:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:35:32] [INFO ] Implicit Places using invariants and state equation in 28011 ms returned []
Implicit Place search using SMT with State Equation took 28604 ms to find 0 implicit places.
[2024-05-22 16:35:32] [INFO ] Redundant transitions in 4 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:35:32] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:35:32] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30020 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 527/1117 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1117 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30023 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 553/1057 places, 531/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88880 ms. Remains : 553/1057 places, 531/997 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-12
Product exploration explored 100000 steps with 13996 reset in 103 ms.
Product exploration explored 100000 steps with 13877 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5504 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3288 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372655 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372655 steps, saw 186381 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:36:36] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-22 16:36:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/106 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/200 variables, 48/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/297 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/405 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/515 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/625 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/625 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 110/735 variables, 56/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/845 variables, 56/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/953 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/953 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 83/1036 variables, 49/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1036 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 40/1076 variables, 24/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1076 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1084 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/106 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/200 variables, 48/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/297 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/405 variables, 54/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/625 variables, 56/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 110/735 variables, 56/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/735 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/845 variables, 56/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/953 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 83/1036 variables, 49/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1036 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 40/1076 variables, 24/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:36:37] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:36:37] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1076 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1076 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/1084 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 862 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2007 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 29 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 475/553 places, 453/531 transitions.
RANDOM walk for 40000 steps (5077 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3332 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411561 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 411561 steps, saw 205897 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:36:42] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:36:42] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/234 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/725 variables, 248/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 203/928 variables, 163/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 27/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 201/234 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 491/725 variables, 248/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 41/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 203/928 variables, 163/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 27/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2751 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:36:46] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:36:46] [INFO ] Implicit Places using invariants in 472 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:36:46] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:36:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:36:56] [INFO ] Implicit Places using invariants and state equation in 9564 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 16:36:56] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10074 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 18 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 16:36:56] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:36:57] [INFO ] Implicit Places using invariants in 500 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 16:36:57] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:36:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:37:06] [INFO ] Implicit Places using invariants and state equation in 9183 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 16:37:06] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9693 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 17 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 16:37:06] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:37:06] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 16:37:06] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:37:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:37:17] [INFO ] Implicit Places using invariants and state equation in 10641 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 16:37:17] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11115 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 17 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 16:37:17] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:37:17] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 16:37:17] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:37:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:37:31] [INFO ] Implicit Places using invariants and state equation in 13656 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 16:37:31] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14101 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 26 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-22 16:37:31] [INFO ] Computed 91 invariants in 54 ms
[2024-05-22 16:37:32] [INFO ] Implicit Places using invariants in 1056 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 16:37:32] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1078 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 16 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 16:37:32] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:37:33] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 16:37:33] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:37:33] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:37:43] [INFO ] Implicit Places using invariants and state equation in 10498 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 16:37:43] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10950 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 16:37:43] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:37:43] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 16:37:43] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:37:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:37:52] [INFO ] Implicit Places using invariants and state equation in 8851 ms returned [134, 139, 159, 164, 185, 191, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 16:37:52] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9238 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 16:37:52] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:37:53] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 16:37:53] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:37:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:00] [INFO ] Implicit Places using invariants and state equation in 7528 ms returned [156, 161, 182, 188, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 16:38:00] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 18 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 16:38:00] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:38:01] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 16:38:01] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:38:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:14] [INFO ] Implicit Places using invariants and state equation in 13021 ms returned [179, 185, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 16:38:14] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13388 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 16:38:14] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:38:14] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 16:38:14] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:38:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:27] [INFO ] Implicit Places using invariants and state equation in 12955 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 16:38:27] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13347 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 21 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 16:38:27] [INFO ] Computed 79 invariants in 33 ms
[2024-05-22 16:38:28] [INFO ] Implicit Places using invariants in 704 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 16:38:28] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 713 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 28 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 16:38:28] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:38:28] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 16:38:28] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:38:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:36] [INFO ] Implicit Places using invariants and state equation in 8345 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 16:38:36] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8690 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 17 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 16:38:37] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 16:38:37] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 16:38:37] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:38:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:46] [INFO ] Implicit Places using invariants and state equation in 8935 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 16:38:46] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 16:38:46] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:38:46] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 16:38:46] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:38:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:38:54] [INFO ] Implicit Places using invariants and state equation in 8160 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 16:38:54] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8513 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 15 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 16:38:54] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:38:55] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 16:38:55] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:38:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:39:07] [INFO ] Implicit Places using invariants and state equation in 12169 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 16:39:07] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12485 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 14 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 16:39:07] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:39:07] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 16:39:07] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:39:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:39:15] [INFO ] Implicit Places using invariants and state equation in 7547 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-22 16:39:15] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7842 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 14 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 16:39:15] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:39:15] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 16:39:15] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:39:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:39:22] [INFO ] Implicit Places using invariants and state equation in 7119 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-22 16:39:22] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7441 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 436
Applied a total of 2 rules in 15 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-22 16:39:22] [INFO ] Computed 65 invariants in 43 ms
[2024-05-22 16:39:23] [INFO ] Implicit Places using invariants in 502 ms returned [392, 397, 416, 422]
[2024-05-22 16:39:23] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 515 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 435
Applied a total of 2 rules in 15 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 16:39:23] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 16:39:23] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 16:39:23] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-22 16:39:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:39:33] [INFO ] Implicit Places using invariants and state equation in 10565 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10858 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 435/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 434
Applied a total of 2 rules in 13 ms. Remains 418 /419 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-22 16:39:34] [INFO ] Computed 61 invariants in 41 ms
[2024-05-22 16:39:34] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-22 16:39:34] [INFO ] Invariant cache hit.
[2024-05-22 16:39:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:39:39] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 5429 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 172997 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 22 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:39:39] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:39:39] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:39:39] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:39:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:40:08] [INFO ] Implicit Places using invariants and state equation in 28147 ms returned []
Implicit Place search using SMT with State Equation took 28451 ms to find 0 implicit places.
[2024-05-22 16:40:08] [INFO ] Redundant transitions in 2 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:40:08] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:40:08] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
SMT process timed out in 30119ms, After SMT, problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58612 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5528 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3235 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 360449 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 360449 steps, saw 180287 distinct states, run finished after 3003 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:40:41] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:40:41] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/106 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 94/200 variables, 48/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/297 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/405 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 110/515 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 110/625 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/625 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 110/735 variables, 56/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/735 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 110/845 variables, 56/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/845 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 108/953 variables, 56/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/953 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 83/1036 variables, 49/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1036 variables, 4/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 40/1076 variables, 24/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1076 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/1084 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1084 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/31 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/106 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/200 variables, 48/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/297 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/405 variables, 54/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 110/515 variables, 56/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/625 variables, 56/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 110/735 variables, 56/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/735 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/735 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 110/845 variables, 56/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/845 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/845 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 108/953 variables, 56/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/953 variables, 4/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 83/1036 variables, 49/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1036 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1036 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 40/1076 variables, 24/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:40:42] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:40:42] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1076 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1076 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/1084 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/1084 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 594 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2426 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 32 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 475/553 places, 453/531 transitions.
RANDOM walk for 40000 steps (5086 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3345 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 402029 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 402029 steps, saw 201131 distinct states, run finished after 3002 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:40:48] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:40:48] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 201/234 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 491/725 variables, 248/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 41/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 203/928 variables, 163/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/928 variables, 27/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/928 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 201/234 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 491/725 variables, 248/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/725 variables, 41/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/725 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 203/928 variables, 163/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/928 variables, 27/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/928 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 928/928 variables, and 554 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3294 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:40:52] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:40:53] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2024-05-22 16:40:53] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:40:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:41:02] [INFO ] Implicit Places using invariants and state equation in 9915 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 16:41:02] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10415 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Applied a total of 2 rules in 23 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 16:41:03] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:41:03] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2024-05-22 16:41:03] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:41:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:41:13] [INFO ] Implicit Places using invariants and state equation in 9849 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 16:41:13] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10340 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 451
Applied a total of 2 rules in 17 ms. Remains 469 /470 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 16:41:13] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:41:13] [INFO ] Implicit Places using invariants in 469 ms returned []
// Phase 1: matrix 451 rows 469 cols
[2024-05-22 16:41:13] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:41:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:41:24] [INFO ] Implicit Places using invariants and state equation in 10568 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 224, 229, 252, 258, 280, 285, 305, 310, 331, 336, 357, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 16:41:24] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11067 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 450
Applied a total of 2 rules in 17 ms. Remains 466 /467 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 16:41:24] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:41:24] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 16:41:24] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:41:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:41:38] [INFO ] Implicit Places using invariants and state equation in 13994 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 16:41:38] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14439 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 449
Applied a total of 2 rules in 17 ms. Remains 463 /464 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 463 cols
[2024-05-22 16:41:38] [INFO ] Computed 91 invariants in 54 ms
[2024-05-22 16:41:39] [INFO ] Implicit Places using invariants in 1051 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 16:41:39] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 449/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 448
Applied a total of 2 rules in 18 ms. Remains 460 /461 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 16:41:40] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:41:40] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 448 rows 460 cols
[2024-05-22 16:41:40] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:41:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:41:50] [INFO ] Implicit Places using invariants and state equation in 10547 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 16:41:50] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10957 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 448/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 447
Applied a total of 2 rules in 16 ms. Remains 457 /458 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 16:41:51] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:41:51] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 447 rows 457 cols
[2024-05-22 16:41:51] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:41:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:00] [INFO ] Implicit Places using invariants and state equation in 8940 ms returned [134, 139, 159, 164, 185, 191, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 16:42:00] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9323 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 447/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 446
Applied a total of 2 rules in 16 ms. Remains 454 /455 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 16:42:00] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:42:00] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 446 rows 454 cols
[2024-05-22 16:42:00] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:42:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:08] [INFO ] Implicit Places using invariants and state equation in 7372 ms returned [156, 161, 182, 188, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 16:42:08] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7761 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 446/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 445
Applied a total of 2 rules in 16 ms. Remains 451 /452 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 16:42:08] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:42:08] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 445 rows 451 cols
[2024-05-22 16:42:08] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:42:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:21] [INFO ] Implicit Places using invariants and state equation in 12988 ms returned [179, 185, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 16:42:21] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13354 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 445/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 444
Applied a total of 2 rules in 16 ms. Remains 448 /449 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 16:42:21] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:42:21] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 444 rows 448 cols
[2024-05-22 16:42:21] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:42:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:34] [INFO ] Implicit Places using invariants and state equation in 12877 ms returned [203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 16:42:34] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13252 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 444/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 443
Applied a total of 2 rules in 15 ms. Remains 445 /446 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 445 cols
[2024-05-22 16:42:34] [INFO ] Computed 79 invariants in 33 ms
[2024-05-22 16:42:35] [INFO ] Implicit Places using invariants in 679 ms returned [228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 16:42:35] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 697 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 443/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 442
Applied a total of 2 rules in 15 ms. Remains 442 /443 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 16:42:35] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:42:35] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 442 rows 442 cols
[2024-05-22 16:42:35] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:42:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:44] [INFO ] Implicit Places using invariants and state equation in 8252 ms returned [253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 16:42:44] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8588 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 442/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 441
Applied a total of 2 rules in 15 ms. Remains 439 /440 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 16:42:44] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:42:44] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 441 rows 439 cols
[2024-05-22 16:42:44] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:42:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:42:53] [INFO ] Implicit Places using invariants and state equation in 8886 ms returned [275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 16:42:53] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9251 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 440
Applied a total of 2 rules in 15 ms. Remains 436 /437 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 16:42:53] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:42:53] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 440 rows 436 cols
[2024-05-22 16:42:53] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:42:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:01] [INFO ] Implicit Places using invariants and state equation in 8107 ms returned [298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 16:43:01] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8451 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 440/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 439
Applied a total of 2 rules in 23 ms. Remains 433 /434 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 16:43:01] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:43:02] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 439 rows 433 cols
[2024-05-22 16:43:02] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:43:02] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:14] [INFO ] Implicit Places using invariants and state equation in 12061 ms returned [321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 16:43:14] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12382 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 439/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 438
Applied a total of 2 rules in 14 ms. Remains 430 /431 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 16:43:14] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:43:14] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 438 rows 430 cols
[2024-05-22 16:43:14] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:43:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:22] [INFO ] Implicit Places using invariants and state equation in 7653 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-22 16:43:22] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7948 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 438/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 437
Applied a total of 2 rules in 14 ms. Remains 427 /428 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 16:43:22] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:43:22] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 437 rows 427 cols
[2024-05-22 16:43:22] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:43:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:29] [INFO ] Implicit Places using invariants and state equation in 7022 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-22 16:43:29] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7312 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 437/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 436
Applied a total of 2 rules in 14 ms. Remains 424 /425 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 424 cols
[2024-05-22 16:43:29] [INFO ] Computed 65 invariants in 41 ms
[2024-05-22 16:43:29] [INFO ] Implicit Places using invariants in 421 ms returned [392, 397, 416, 422]
[2024-05-22 16:43:29] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 436/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 435
Applied a total of 2 rules in 14 ms. Remains 421 /422 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 16:43:29] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:43:30] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 435 rows 421 cols
[2024-05-22 16:43:30] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:43:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:40] [INFO ] Implicit Places using invariants and state equation in 10399 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10710 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 435/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 434
Applied a total of 2 rules in 15 ms. Remains 418 /419 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 418 cols
[2024-05-22 16:43:40] [INFO ] Computed 61 invariants in 41 ms
[2024-05-22 16:43:41] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-22 16:43:41] [INFO ] Invariant cache hit.
[2024-05-22 16:43:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:43:45] [INFO ] Implicit Places using invariants and state equation in 4875 ms returned []
Implicit Place search using SMT with State Equation took 5268 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 173350 ms. Remains : 418/475 places, 434/453 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13792 reset in 103 ms.
Product exploration explored 100000 steps with 13843 reset in 112 ms.
Built C files in :
/tmp/ltsmin13181122166179761686
[2024-05-22 16:43:46] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-22 16:43:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:43:46] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-22 16:43:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:43:46] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-22 16:43:46] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:43:46] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13181122166179761686
Running compilation step : cd /tmp/ltsmin13181122166179761686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1557 ms.
Running link step : cd /tmp/ltsmin13181122166179761686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13181122166179761686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15619510079363713874.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 18 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:44:01] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:44:01] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:44:01] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:44:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:44:29] [INFO ] Implicit Places using invariants and state equation in 28128 ms returned []
Implicit Place search using SMT with State Equation took 28399 ms to find 0 implicit places.
[2024-05-22 16:44:29] [INFO ] Redundant transitions in 2 ms returned []
Running 530 sub problems to find dead transitions.
// Phase 1: matrix 531 rows 553 cols
[2024-05-22 16:44:30] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:44:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 4 (OVERLAPS) 1/1084 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 591 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30031 ms.
Refiners :[State Equation: 553/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 530/530 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 530 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 1 (OVERLAPS) 531/1083 variables, 552/552 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1083 variables, 38/590 constraints. Problems are: Problem set: 0 solved, 530 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 527/1117 constraints. Problems are: Problem set: 0 solved, 530 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1084 variables, and 1117 constraints, problems are : Problem set: 0 solved, 530 unsolved in 30013 ms.
Refiners :[State Equation: 552/553 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 527/530 constraints, Known Traps: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 530 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88616 ms. Remains : 553/553 places, 531/531 transitions.
Built C files in :
/tmp/ltsmin1660026984196093792
[2024-05-22 16:45:30] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2024-05-22 16:45:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:45:30] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2024-05-22 16:45:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:45:30] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2024-05-22 16:45:30] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:45:30] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1660026984196093792
Running compilation step : cd /tmp/ltsmin1660026984196093792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1420 ms.
Running link step : cd /tmp/ltsmin1660026984196093792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1660026984196093792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9577494467271051370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 16:45:45] [INFO ] Flatten gal took : 29 ms
[2024-05-22 16:45:45] [INFO ] Flatten gal took : 29 ms
[2024-05-22 16:45:45] [INFO ] Time to serialize gal into /tmp/LTL2831917349542884057.gal : 7 ms
[2024-05-22 16:45:45] [INFO ] Time to serialize properties into /tmp/LTL11979020511122964255.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2831917349542884057.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2467708066866358839.hoa' '-atoms' '/tmp/LTL11979020511122964255.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11979020511122964255.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2467708066866358839.hoa
Detected timeout of ITS tools.
[2024-05-22 16:46:00] [INFO ] Flatten gal took : 36 ms
[2024-05-22 16:46:00] [INFO ] Flatten gal took : 21 ms
[2024-05-22 16:46:00] [INFO ] Time to serialize gal into /tmp/LTL14843064193158021643.gal : 5 ms
[2024-05-22 16:46:00] [INFO ] Time to serialize properties into /tmp/LTL1900450493659371537.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14843064193158021643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1900450493659371537.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(p490<1)"))))
Formula 0 simplified : FG!"(p490<1)"
Detected timeout of ITS tools.
[2024-05-22 16:46:15] [INFO ] Flatten gal took : 23 ms
[2024-05-22 16:46:15] [INFO ] Applying decomposition
[2024-05-22 16:46:15] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14628985304281891396.txt' '-o' '/tmp/graph14628985304281891396.bin' '-w' '/tmp/graph14628985304281891396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14628985304281891396.bin' '-l' '-1' '-v' '-w' '/tmp/graph14628985304281891396.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:46:15] [INFO ] Decomposing Gal with order
[2024-05-22 16:46:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:46:15] [INFO ] Removed a total of 408 redundant transitions.
[2024-05-22 16:46:16] [INFO ] Flatten gal took : 170 ms
[2024-05-22 16:46:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 54 ms.
[2024-05-22 16:46:16] [INFO ] Time to serialize gal into /tmp/LTL16309534575789559549.gal : 23 ms
[2024-05-22 16:46:16] [INFO ] Time to serialize properties into /tmp/LTL17793464228805034460.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16309534575789559549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17793464228805034460.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i4.u106.p490<1)"))))
Formula 0 simplified : FG!"(i4.u106.p490<1)"
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLCardinality-12 finished in 687261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 6 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 238 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 479 place count 816 transition count 714
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 563 place count 774 transition count 714
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 2 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 919 place count 596 transition count 536
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 993 place count 559 transition count 536
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 559 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 558 transition count 535
Applied a total of 995 rules in 80 ms. Remains 558 /1057 variables (removed 499) and now considering 535/997 (removed 462) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 16:46:31] [INFO ] Computed 99 invariants in 51 ms
[2024-05-22 16:46:31] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-22 16:46:31] [INFO ] Invariant cache hit.
[2024-05-22 16:46:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:46:39] [INFO ] Implicit Places using invariants and state equation in 8310 ms returned []
Implicit Place search using SMT with State Equation took 8638 ms to find 0 implicit places.
[2024-05-22 16:46:39] [INFO ] Redundant transitions in 3 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 16:46:39] [INFO ] Invariant cache hit.
[2024-05-22 16:46:39] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1057 places, 535/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38861 ms. Remains : 558/1057 places, 535/997 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-14
Product exploration explored 100000 steps with 14038 reset in 126 ms.
Product exploration explored 100000 steps with 13841 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5627 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3221 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3251 resets) in 395 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3254 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3232 resets) in 374 ms. (106 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 124812 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 124812 steps, saw 62416 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-22 16:47:14] [INFO ] Invariant cache hit.
[2024-05-22 16:47:14] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/1027 variables, 502/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/1087 variables, 51/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1089 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1089 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1089 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/1093 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 695 constraints, problems are : Problem set: 0 solved, 4 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 558/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:15] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 525/1027 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 36/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/1087 variables, 51/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1087 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:17] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-22 16:47:17] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-22 16:47:18] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-22 16:47:18] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2024-05-22 16:47:19] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 1 ms to minimize.
[2024-05-22 16:47:19] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:47:19] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2024-05-22 16:47:19] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-22 16:47:20] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/1093 variables, and 701 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 553/558 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 5896ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1658 edges and 558 vertex of which 557 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 557 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 82 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 160 place count 478 transition count 455
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 235 place count 478 transition count 455
Applied a total of 235 rules in 39 ms. Remains 478 /558 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 478/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5121 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3358 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3369 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 137117 steps, run timeout after 3026 ms. (steps per millisecond=45 ) properties seen :0 out of 4
Probabilistic random walk after 137117 steps, saw 68576 distinct states, run finished after 3026 ms. (steps per millisecond=45 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:47:23] [INFO ] Computed 99 invariants in 41 ms
[2024-05-22 16:47:23] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/473 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 455/928 variables, 473/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/928 variables, 73/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/933 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 650 constraints, problems are : Problem set: 0 solved, 4 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:24] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 3 ms to minimize.
[2024-05-22 16:47:25] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:47:25] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 3 ms to minimize.
[2024-05-22 16:47:25] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 16 ms to minimize.
[2024-05-22 16:47:25] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/473 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:26] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 3 ms to minimize.
[2024-05-22 16:47:26] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 3 ms to minimize.
[2024-05-22 16:47:26] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 3 ms to minimize.
[2024-05-22 16:47:27] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:47:27] [INFO ] Deduced a trap composed of 114 places in 253 ms of which 3 ms to minimize.
[2024-05-22 16:47:27] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 3 ms to minimize.
[2024-05-22 16:47:27] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 3 ms to minimize.
[2024-05-22 16:47:28] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-05-22 16:47:28] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:47:28] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2024-05-22 16:47:28] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:47:29] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 3 ms to minimize.
[2024-05-22 16:47:29] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 21 ms to minimize.
[2024-05-22 16:47:29] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 2 ms to minimize.
[2024-05-22 16:47:29] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 3 ms to minimize.
[2024-05-22 16:47:30] [INFO ] Deduced a trap composed of 124 places in 218 ms of which 2 ms to minimize.
[2024-05-22 16:47:30] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 3 ms to minimize.
[2024-05-22 16:47:30] [INFO ] Deduced a trap composed of 28 places in 224 ms of which 2 ms to minimize.
[2024-05-22 16:47:30] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:47:30] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:31] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 3 ms to minimize.
[2024-05-22 16:47:31] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2024-05-22 16:47:31] [INFO ] Deduced a trap composed of 137 places in 218 ms of which 2 ms to minimize.
[2024-05-22 16:47:31] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:47:32] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:47:32] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 2 ms to minimize.
[2024-05-22 16:47:32] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 2 ms to minimize.
[2024-05-22 16:47:32] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 2 ms to minimize.
[2024-05-22 16:47:33] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-05-22 16:47:33] [INFO ] Deduced a trap composed of 108 places in 226 ms of which 2 ms to minimize.
[2024-05-22 16:47:33] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:47:33] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-22 16:47:34] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 2 ms to minimize.
[2024-05-22 16:47:34] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 2 ms to minimize.
[2024-05-22 16:47:34] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 2 ms to minimize.
[2024-05-22 16:47:34] [INFO ] Deduced a trap composed of 136 places in 208 ms of which 2 ms to minimize.
[2024-05-22 16:47:34] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:47:35] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 3 ms to minimize.
[2024-05-22 16:47:35] [INFO ] Deduced a trap composed of 124 places in 226 ms of which 2 ms to minimize.
[2024-05-22 16:47:35] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:35] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:47:36] [INFO ] Deduced a trap composed of 125 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:47:36] [INFO ] Deduced a trap composed of 120 places in 226 ms of which 3 ms to minimize.
[2024-05-22 16:47:36] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 2 ms to minimize.
[2024-05-22 16:47:36] [INFO ] Deduced a trap composed of 129 places in 226 ms of which 2 ms to minimize.
[2024-05-22 16:47:37] [INFO ] Deduced a trap composed of 120 places in 229 ms of which 2 ms to minimize.
[2024-05-22 16:47:37] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-22 16:47:37] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-22 16:47:37] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2024-05-22 16:47:37] [INFO ] Deduced a trap composed of 136 places in 226 ms of which 3 ms to minimize.
[2024-05-22 16:47:38] [INFO ] Deduced a trap composed of 144 places in 249 ms of which 3 ms to minimize.
[2024-05-22 16:47:38] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:47:38] [INFO ] Deduced a trap composed of 134 places in 218 ms of which 3 ms to minimize.
[2024-05-22 16:47:38] [INFO ] Deduced a trap composed of 135 places in 212 ms of which 2 ms to minimize.
[2024-05-22 16:47:38] [INFO ] Deduced a trap composed of 117 places in 221 ms of which 2 ms to minimize.
[2024-05-22 16:47:39] [INFO ] Deduced a trap composed of 130 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:47:39] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:47:39] [INFO ] Deduced a trap composed of 124 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:47:39] [INFO ] Deduced a trap composed of 122 places in 259 ms of which 3 ms to minimize.
[2024-05-22 16:47:40] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:40] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 2 ms to minimize.
[2024-05-22 16:47:40] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 2 ms to minimize.
[2024-05-22 16:47:40] [INFO ] Deduced a trap composed of 137 places in 234 ms of which 2 ms to minimize.
[2024-05-22 16:47:41] [INFO ] Deduced a trap composed of 135 places in 210 ms of which 2 ms to minimize.
[2024-05-22 16:47:41] [INFO ] Deduced a trap composed of 136 places in 230 ms of which 2 ms to minimize.
[2024-05-22 16:47:41] [INFO ] Deduced a trap composed of 134 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:47:41] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 2 ms to minimize.
[2024-05-22 16:47:42] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 2 ms to minimize.
[2024-05-22 16:47:42] [INFO ] Deduced a trap composed of 90 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:47:42] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:47:42] [INFO ] Deduced a trap composed of 130 places in 222 ms of which 2 ms to minimize.
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 123 places in 225 ms of which 2 ms to minimize.
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 130 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 122 places in 221 ms of which 2 ms to minimize.
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 121 places in 233 ms of which 2 ms to minimize.
[2024-05-22 16:47:43] [INFO ] Deduced a trap composed of 88 places in 237 ms of which 3 ms to minimize.
[2024-05-22 16:47:44] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 2 ms to minimize.
[2024-05-22 16:47:44] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 2 ms to minimize.
[2024-05-22 16:47:44] [INFO ] Deduced a trap composed of 121 places in 261 ms of which 2 ms to minimize.
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 120 places in 236 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 2 ms to minimize.
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 3 ms to minimize.
[2024-05-22 16:47:45] [INFO ] Deduced a trap composed of 145 places in 258 ms of which 2 ms to minimize.
[2024-05-22 16:47:46] [INFO ] Deduced a trap composed of 135 places in 245 ms of which 3 ms to minimize.
[2024-05-22 16:47:46] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:47:46] [INFO ] Deduced a trap composed of 135 places in 239 ms of which 3 ms to minimize.
[2024-05-22 16:47:46] [INFO ] Deduced a trap composed of 134 places in 235 ms of which 2 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 145 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 134 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 129 places in 234 ms of which 3 ms to minimize.
[2024-05-22 16:47:47] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 3 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 137 places in 242 ms of which 3 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 135 places in 239 ms of which 2 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:47:48] [INFO ] Deduced a trap composed of 135 places in 222 ms of which 2 ms to minimize.
[2024-05-22 16:47:49] [INFO ] Deduced a trap composed of 142 places in 252 ms of which 3 ms to minimize.
[2024-05-22 16:47:49] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 2 ms to minimize.
[2024-05-22 16:47:49] [INFO ] Deduced a trap composed of 125 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:47:49] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:47:50] [INFO ] Deduced a trap composed of 141 places in 242 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:47:50] [INFO ] Deduced a trap composed of 148 places in 244 ms of which 3 ms to minimize.
[2024-05-22 16:47:50] [INFO ] Deduced a trap composed of 137 places in 246 ms of which 2 ms to minimize.
[2024-05-22 16:47:50] [INFO ] Deduced a trap composed of 125 places in 238 ms of which 2 ms to minimize.
[2024-05-22 16:47:51] [INFO ] Deduced a trap composed of 106 places in 253 ms of which 2 ms to minimize.
[2024-05-22 16:47:51] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-05-22 16:47:51] [INFO ] Deduced a trap composed of 120 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:47:51] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 2 ms to minimize.
[2024-05-22 16:47:52] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 2 ms to minimize.
[2024-05-22 16:47:52] [INFO ] Deduced a trap composed of 130 places in 236 ms of which 3 ms to minimize.
[2024-05-22 16:47:52] [INFO ] Deduced a trap composed of 127 places in 215 ms of which 2 ms to minimize.
[2024-05-22 16:47:52] [INFO ] Deduced a trap composed of 144 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 127 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 123 places in 247 ms of which 2 ms to minimize.
[2024-05-22 16:47:53] [INFO ] Deduced a trap composed of 122 places in 217 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 455/928 variables, 473/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 73/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:48:02] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:48:02] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2024-05-22 16:48:03] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:48:04] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:48:04] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:48:05] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/928 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/928 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 5/933 variables, 5/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/933 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/933 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/933 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 780 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 126/126 constraints]
After SMT, in 42723ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 6 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-05-22 16:48:36] [INFO ] Invariant cache hit.
[2024-05-22 16:48:37] [INFO ] Implicit Places using invariants in 1363 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 336, 341, 362, 369, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-22 16:48:37] [INFO ] Actually due to overlaps returned [213, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1367 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 475 transition count 454
Applied a total of 2 rules in 28 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:48:37] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:48:38] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:48:38] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:48:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:48:54] [INFO ] Implicit Places using invariants and state equation in 15899 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 16:48:54] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16363 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 453
Applied a total of 2 rules in 17 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:48:54] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:48:54] [INFO ] Implicit Places using invariants in 445 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:48:54] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:48:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:49:04] [INFO ] Implicit Places using invariants and state equation in 9825 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 392, 412, 418, 440, 445, 464, 470]
[2024-05-22 16:49:04] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10282 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 452
Applied a total of 2 rules in 16 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:49:04] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:49:05] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:49:05] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:49:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:49:13] [INFO ] Implicit Places using invariants and state equation in 8391 ms returned [66, 71, 92, 97, 117, 123, 144, 149, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 303, 308, 330, 335, 356, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 16:49:13] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8816 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 451
Applied a total of 2 rules in 16 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:49:13] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:49:13] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:49:13] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 16:49:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:49:22] [INFO ] Implicit Places using invariants and state equation in 8739 ms returned [89, 94, 114, 120, 141, 146, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 300, 305, 327, 332, 353, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 16:49:22] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 450
Applied a total of 2 rules in 17 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:49:22] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-22 16:49:23] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:49:23] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 16:49:23] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:49:33] [INFO ] Implicit Places using invariants and state equation in 10785 ms returned [111, 117, 138, 143, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 297, 302, 324, 329, 350, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 16:49:33] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 11221 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 449
Applied a total of 2 rules in 16 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:49:33] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:49:34] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:49:34] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:49:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:49:54] [INFO ] Implicit Places using invariants and state equation in 20652 ms returned [135, 140, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 294, 299, 321, 326, 347, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 16:49:54] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21063 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 448
Applied a total of 2 rules in 18 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:49:54] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:49:55] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:49:55] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:49:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:04] [INFO ] Implicit Places using invariants and state equation in 9414 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 291, 296, 318, 323, 344, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 16:50:04] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9789 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Applied a total of 1 rules in 16 ms. Remains 455 /455 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 455 cols
[2024-05-22 16:50:04] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:50:05] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2024-05-22 16:50:05] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:50:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:18] [INFO ] Implicit Places using invariants and state equation in 13534 ms returned [182, 188, 207, 212, 235, 241, 263, 268, 289, 294, 316, 321, 342, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2024-05-22 16:50:18] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13909 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 453/478 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 447
Applied a total of 2 rules in 15 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2024-05-22 16:50:18] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:50:19] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2024-05-22 16:50:19] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:50:19] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:31] [INFO ] Implicit Places using invariants and state equation in 12671 ms returned [204, 209, 232, 238, 260, 265, 286, 291, 313, 318, 339, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2024-05-22 16:50:31] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13010 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 450/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 446
Applied a total of 2 rules in 24 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2024-05-22 16:50:31] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:50:32] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2024-05-22 16:50:32] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:50:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:41] [INFO ] Implicit Places using invariants and state equation in 9084 ms returned [229, 235, 257, 262, 283, 288, 310, 315, 336, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2024-05-22 16:50:41] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9420 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 447/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 445
Applied a total of 2 rules in 32 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2024-05-22 16:50:41] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:50:41] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2024-05-22 16:50:41] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:50:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:48] [INFO ] Implicit Places using invariants and state equation in 7155 ms returned [254, 259, 280, 285, 307, 312, 333, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2024-05-22 16:50:48] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7520 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 444/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 444
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2024-05-22 16:50:48] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 16:50:49] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 444 rows 443 cols
[2024-05-22 16:50:49] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:50:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:50:57] [INFO ] Implicit Places using invariants and state equation in 8359 ms returned [277, 282, 304, 309, 330, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2024-05-22 16:50:57] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8671 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 441/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 443
Applied a total of 2 rules in 15 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2024-05-22 16:50:57] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:50:57] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2024-05-22 16:50:57] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:50:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:51:05] [INFO ] Implicit Places using invariants and state equation in 7484 ms returned [301, 306, 327, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2024-05-22 16:51:05] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7827 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 438/478 places, 443/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 148700 ms. Remains : 438/478 places, 443/455 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 16 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 16:51:05] [INFO ] Computed 99 invariants in 57 ms
[2024-05-22 16:51:05] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-22 16:51:05] [INFO ] Invariant cache hit.
[2024-05-22 16:51:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:51:14] [INFO ] Implicit Places using invariants and state equation in 8760 ms returned []
Implicit Place search using SMT with State Equation took 9094 ms to find 0 implicit places.
[2024-05-22 16:51:14] [INFO ] Redundant transitions in 4 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 16:51:14] [INFO ] Invariant cache hit.
[2024-05-22 16:51:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1093 variables, and 694 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 531/1225 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1093 variables, and 1225 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69298 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1738 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5527 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3266 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3243 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3262 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3254 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191893 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191893 steps, saw 95981 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-22 16:52:18] [INFO ] Invariant cache hit.
[2024-05-22 16:52:18] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/1027 variables, 502/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1027 variables, 36/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 60/1087 variables, 51/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 1/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/1089 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1089 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1089 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/1093 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1093 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1093/1093 variables, and 695 constraints, problems are : Problem set: 0 solved, 4 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 558/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 271/277 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 211/488 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/502 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:19] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 525/1027 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1027 variables, 36/634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1027 variables, 4/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1027 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 60/1087 variables, 51/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1087 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:22] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:52:22] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 3 ms to minimize.
[2024-05-22 16:52:22] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:52:23] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 3 ms to minimize.
[2024-05-22 16:52:23] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:52:23] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-22 16:52:23] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 2 ms to minimize.
[2024-05-22 16:52:24] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-05-22 16:52:24] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-22 16:52:24] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1087/1093 variables, and 702 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 95/97 constraints, State Equation: 553/558 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
After SMT, in 5867ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1658 edges and 558 vertex of which 557 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 (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 557 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 82 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 160 place count 478 transition count 455
Partial Free-agglomeration rule applied 75 times.
Drop transitions (Partial Free agglomeration) removed 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 235 place count 478 transition count 455
Applied a total of 235 rules in 43 ms. Remains 478 /558 variables (removed 80) and now considering 455/535 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 478/558 places, 455/535 transitions.
RANDOM walk for 40000 steps (5103 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3339 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3376 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3418 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3320 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 195233 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 195233 steps, saw 97628 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 455 rows 478 cols
[2024-05-22 16:52:27] [INFO ] Computed 99 invariants in 50 ms
[2024-05-22 16:52:27] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/473 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 455/928 variables, 473/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/928 variables, 73/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/928 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/933 variables, 5/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 2/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/933 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 650 constraints, problems are : Problem set: 0 solved, 4 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 261/267 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/320 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 149/469 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:29] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 3 ms to minimize.
[2024-05-22 16:52:29] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 3 ms to minimize.
[2024-05-22 16:52:29] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 2 ms to minimize.
[2024-05-22 16:52:29] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:52:30] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/473 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:30] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 2 ms to minimize.
[2024-05-22 16:52:30] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:52:30] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 3 ms to minimize.
[2024-05-22 16:52:31] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 3 ms to minimize.
[2024-05-22 16:52:31] [INFO ] Deduced a trap composed of 114 places in 246 ms of which 3 ms to minimize.
[2024-05-22 16:52:31] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 2 ms to minimize.
[2024-05-22 16:52:31] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2024-05-22 16:52:32] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-05-22 16:52:32] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 3 ms to minimize.
[2024-05-22 16:52:32] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 2 ms to minimize.
[2024-05-22 16:52:32] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 2 ms to minimize.
[2024-05-22 16:52:33] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 2 ms to minimize.
[2024-05-22 16:52:33] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2024-05-22 16:52:33] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 3 ms to minimize.
[2024-05-22 16:52:33] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 2 ms to minimize.
[2024-05-22 16:52:33] [INFO ] Deduced a trap composed of 124 places in 214 ms of which 3 ms to minimize.
[2024-05-22 16:52:34] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:52:34] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:52:34] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 2 ms to minimize.
[2024-05-22 16:52:34] [INFO ] Deduced a trap composed of 126 places in 216 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:35] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:52:35] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-05-22 16:52:35] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 4 ms to minimize.
[2024-05-22 16:52:35] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:52:36] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:52:36] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 2 ms to minimize.
[2024-05-22 16:52:36] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:52:36] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 2 ms to minimize.
[2024-05-22 16:52:37] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 3 ms to minimize.
[2024-05-22 16:52:37] [INFO ] Deduced a trap composed of 108 places in 220 ms of which 3 ms to minimize.
[2024-05-22 16:52:37] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 2 ms to minimize.
[2024-05-22 16:52:37] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:52:37] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 3 ms to minimize.
[2024-05-22 16:52:38] [INFO ] Deduced a trap composed of 131 places in 216 ms of which 3 ms to minimize.
[2024-05-22 16:52:38] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 2 ms to minimize.
[2024-05-22 16:52:38] [INFO ] Deduced a trap composed of 136 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:52:38] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:52:39] [INFO ] Deduced a trap composed of 133 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:52:39] [INFO ] Deduced a trap composed of 124 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:52:39] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:39] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-05-22 16:52:40] [INFO ] Deduced a trap composed of 125 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:52:40] [INFO ] Deduced a trap composed of 120 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:52:40] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 10 ms to minimize.
[2024-05-22 16:52:40] [INFO ] Deduced a trap composed of 129 places in 216 ms of which 3 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 120 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 136 places in 228 ms of which 2 ms to minimize.
[2024-05-22 16:52:41] [INFO ] Deduced a trap composed of 144 places in 220 ms of which 3 ms to minimize.
[2024-05-22 16:52:42] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-05-22 16:52:42] [INFO ] Deduced a trap composed of 134 places in 210 ms of which 3 ms to minimize.
[2024-05-22 16:52:42] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:52:42] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 2 ms to minimize.
[2024-05-22 16:52:43] [INFO ] Deduced a trap composed of 130 places in 208 ms of which 3 ms to minimize.
[2024-05-22 16:52:43] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 2 ms to minimize.
[2024-05-22 16:52:43] [INFO ] Deduced a trap composed of 124 places in 217 ms of which 2 ms to minimize.
[2024-05-22 16:52:43] [INFO ] Deduced a trap composed of 122 places in 212 ms of which 3 ms to minimize.
[2024-05-22 16:52:44] [INFO ] Deduced a trap composed of 121 places in 211 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:44] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 2 ms to minimize.
[2024-05-22 16:52:44] [INFO ] Deduced a trap composed of 141 places in 217 ms of which 5 ms to minimize.
[2024-05-22 16:52:44] [INFO ] Deduced a trap composed of 137 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:52:44] [INFO ] Deduced a trap composed of 135 places in 208 ms of which 3 ms to minimize.
[2024-05-22 16:52:45] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 2 ms to minimize.
[2024-05-22 16:52:45] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 2 ms to minimize.
[2024-05-22 16:52:45] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 3 ms to minimize.
[2024-05-22 16:52:45] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 2 ms to minimize.
[2024-05-22 16:52:46] [INFO ] Deduced a trap composed of 90 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:52:46] [INFO ] Deduced a trap composed of 126 places in 222 ms of which 3 ms to minimize.
[2024-05-22 16:52:46] [INFO ] Deduced a trap composed of 130 places in 221 ms of which 2 ms to minimize.
[2024-05-22 16:52:46] [INFO ] Deduced a trap composed of 123 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:52:47] [INFO ] Deduced a trap composed of 130 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:52:47] [INFO ] Deduced a trap composed of 122 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:52:47] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:52:47] [INFO ] Deduced a trap composed of 88 places in 228 ms of which 2 ms to minimize.
[2024-05-22 16:52:48] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 3 ms to minimize.
[2024-05-22 16:52:48] [INFO ] Deduced a trap composed of 126 places in 224 ms of which 3 ms to minimize.
[2024-05-22 16:52:48] [INFO ] Deduced a trap composed of 121 places in 228 ms of which 3 ms to minimize.
[2024-05-22 16:52:48] [INFO ] Deduced a trap composed of 120 places in 227 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:48] [INFO ] Deduced a trap composed of 139 places in 247 ms of which 3 ms to minimize.
[2024-05-22 16:52:49] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:52:49] [INFO ] Deduced a trap composed of 145 places in 246 ms of which 3 ms to minimize.
[2024-05-22 16:52:49] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 3 ms to minimize.
[2024-05-22 16:52:50] [INFO ] Deduced a trap composed of 139 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:52:50] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 2 ms to minimize.
[2024-05-22 16:52:50] [INFO ] Deduced a trap composed of 134 places in 231 ms of which 3 ms to minimize.
[2024-05-22 16:52:50] [INFO ] Deduced a trap composed of 145 places in 253 ms of which 3 ms to minimize.
[2024-05-22 16:52:51] [INFO ] Deduced a trap composed of 134 places in 242 ms of which 3 ms to minimize.
[2024-05-22 16:52:51] [INFO ] Deduced a trap composed of 129 places in 236 ms of which 3 ms to minimize.
[2024-05-22 16:52:51] [INFO ] Deduced a trap composed of 139 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:52:51] [INFO ] Deduced a trap composed of 137 places in 250 ms of which 3 ms to minimize.
[2024-05-22 16:52:52] [INFO ] Deduced a trap composed of 135 places in 233 ms of which 3 ms to minimize.
[2024-05-22 16:52:52] [INFO ] Deduced a trap composed of 135 places in 227 ms of which 3 ms to minimize.
[2024-05-22 16:52:52] [INFO ] Deduced a trap composed of 135 places in 230 ms of which 2 ms to minimize.
[2024-05-22 16:52:52] [INFO ] Deduced a trap composed of 142 places in 235 ms of which 3 ms to minimize.
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 2 ms to minimize.
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 125 places in 246 ms of which 3 ms to minimize.
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 128 places in 245 ms of which 3 ms to minimize.
[2024-05-22 16:52:53] [INFO ] Deduced a trap composed of 141 places in 241 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:52:54] [INFO ] Deduced a trap composed of 148 places in 236 ms of which 2 ms to minimize.
[2024-05-22 16:52:54] [INFO ] Deduced a trap composed of 137 places in 232 ms of which 3 ms to minimize.
[2024-05-22 16:52:54] [INFO ] Deduced a trap composed of 125 places in 241 ms of which 2 ms to minimize.
[2024-05-22 16:52:54] [INFO ] Deduced a trap composed of 106 places in 233 ms of which 2 ms to minimize.
[2024-05-22 16:52:55] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 3 ms to minimize.
[2024-05-22 16:52:55] [INFO ] Deduced a trap composed of 120 places in 225 ms of which 2 ms to minimize.
[2024-05-22 16:52:55] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 3 ms to minimize.
[2024-05-22 16:52:55] [INFO ] Deduced a trap composed of 127 places in 238 ms of which 3 ms to minimize.
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 130 places in 242 ms of which 3 ms to minimize.
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 127 places in 240 ms of which 3 ms to minimize.
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 144 places in 235 ms of which 3 ms to minimize.
[2024-05-22 16:52:56] [INFO ] Deduced a trap composed of 127 places in 237 ms of which 3 ms to minimize.
[2024-05-22 16:52:57] [INFO ] Deduced a trap composed of 119 places in 239 ms of which 3 ms to minimize.
[2024-05-22 16:52:57] [INFO ] Deduced a trap composed of 123 places in 230 ms of which 2 ms to minimize.
[2024-05-22 16:52:57] [INFO ] Deduced a trap composed of 122 places in 233 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 455/928 variables, 473/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/928 variables, 73/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:53:06] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-22 16:53:06] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-05-22 16:53:07] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:53:08] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:53:08] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 16:53:09] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/928 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/928 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 5/933 variables, 5/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/933 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/933 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/933 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 780 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42062 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 478/478 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 126/126 constraints]
After SMT, in 42732ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30000 ms.
Support contains 6 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2024-05-22 16:53:40] [INFO ] Invariant cache hit.
[2024-05-22 16:53:42] [INFO ] Implicit Places using invariants in 1418 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 153, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 336, 341, 362, 369, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
[2024-05-22 16:53:42] [INFO ] Actually due to overlaps returned [213, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1421 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 475 transition count 454
Applied a total of 2 rules in 20 ms. Remains 475 /476 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:53:42] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:53:42] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 454 rows 475 cols
[2024-05-22 16:53:42] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 16:53:42] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:53:59] [INFO ] Implicit Places using invariants and state equation in 16677 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 16:53:59] [INFO ] Actually due to overlaps returned [450, 389]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17155 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 473/478 places, 454/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 453
Applied a total of 2 rules in 19 ms. Remains 472 /473 variables (removed 1) and now considering 453/454 (removed 1) transitions.
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:53:59] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:53:59] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2024-05-22 16:53:59] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:54:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:54:10] [INFO ] Implicit Places using invariants and state equation in 10397 ms returned [42, 48, 69, 74, 95, 100, 120, 126, 147, 152, 173, 178, 199, 205, 224, 229, 252, 258, 280, 285, 306, 311, 333, 338, 359, 366, 387, 392, 412, 418, 440, 445, 464, 470]
[2024-05-22 16:54:10] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10907 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/478 places, 453/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 452
Applied a total of 2 rules in 18 ms. Remains 469 /470 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:54:10] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:54:10] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 452 rows 469 cols
[2024-05-22 16:54:10] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:54:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:54:19] [INFO ] Implicit Places using invariants and state equation in 8789 ms returned [66, 71, 92, 97, 117, 123, 144, 149, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 303, 308, 330, 335, 356, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 16:54:19] [INFO ] Actually due to overlaps returned [71, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9229 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 467/478 places, 452/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 451
Applied a total of 2 rules in 20 ms. Remains 466 /467 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:54:19] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 16:54:19] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 451 rows 466 cols
[2024-05-22 16:54:19] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 16:54:20] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:54:29] [INFO ] Implicit Places using invariants and state equation in 9210 ms returned [89, 94, 114, 120, 141, 146, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 300, 305, 327, 332, 353, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 16:54:29] [INFO ] Actually due to overlaps returned [94, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9703 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 464/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 450
Applied a total of 2 rules in 18 ms. Remains 463 /464 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:54:29] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-22 16:54:29] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 450 rows 463 cols
[2024-05-22 16:54:29] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 16:54:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:54:41] [INFO ] Implicit Places using invariants and state equation in 11549 ms returned [111, 117, 138, 143, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 297, 302, 324, 329, 350, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 16:54:41] [INFO ] Actually due to overlaps returned [117, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12004 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 461/478 places, 450/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 449
Applied a total of 2 rules in 16 ms. Remains 460 /461 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:54:41] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:54:41] [INFO ] Implicit Places using invariants in 436 ms returned []
// Phase 1: matrix 449 rows 460 cols
[2024-05-22 16:54:41] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:54:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:02] [INFO ] Implicit Places using invariants and state equation in 20792 ms returned [135, 140, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 294, 299, 321, 326, 347, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 16:55:02] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21243 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 458/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 448
Applied a total of 2 rules in 29 ms. Remains 457 /458 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:55:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:55:02] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 448 rows 457 cols
[2024-05-22 16:55:02] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:55:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:12] [INFO ] Implicit Places using invariants and state equation in 9368 ms returned [158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 291, 296, 318, 323, 344, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 16:55:12] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9808 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 455/478 places, 448/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 448
Applied a total of 1 rules in 15 ms. Remains 455 /455 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 455 cols
[2024-05-22 16:55:12] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:55:12] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 448 rows 455 cols
[2024-05-22 16:55:12] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:55:12] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:26] [INFO ] Implicit Places using invariants and state equation in 13544 ms returned [182, 188, 207, 212, 235, 241, 263, 268, 289, 294, 316, 321, 342, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2024-05-22 16:55:26] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13902 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 453/478 places, 448/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 447
Applied a total of 2 rules in 16 ms. Remains 452 /453 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 452 cols
[2024-05-22 16:55:26] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:55:26] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 447 rows 452 cols
[2024-05-22 16:55:26] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:55:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:39] [INFO ] Implicit Places using invariants and state equation in 13163 ms returned [204, 209, 232, 238, 260, 265, 286, 291, 313, 318, 339, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2024-05-22 16:55:39] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13505 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 450/478 places, 447/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 446
Applied a total of 2 rules in 16 ms. Remains 449 /450 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 449 cols
[2024-05-22 16:55:39] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:55:40] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 446 rows 449 cols
[2024-05-22 16:55:40] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:55:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:49] [INFO ] Implicit Places using invariants and state equation in 9311 ms returned [229, 235, 257, 262, 283, 288, 310, 315, 336, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2024-05-22 16:55:49] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9681 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 447/478 places, 446/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 445
Applied a total of 2 rules in 15 ms. Remains 446 /447 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 446 cols
[2024-05-22 16:55:49] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 16:55:49] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2024-05-22 16:55:49] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 16:55:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:55:57] [INFO ] Implicit Places using invariants and state equation in 7272 ms returned [254, 259, 280, 285, 307, 312, 333, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2024-05-22 16:55:57] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7683 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 444/478 places, 445/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 444
Applied a total of 2 rules in 23 ms. Remains 443 /444 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 443 cols
[2024-05-22 16:55:57] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 16:55:57] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 444 rows 443 cols
[2024-05-22 16:55:57] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-22 16:55:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:56:06] [INFO ] Implicit Places using invariants and state equation in 8814 ms returned [277, 282, 304, 309, 330, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2024-05-22 16:56:06] [INFO ] Actually due to overlaps returned [282, 277]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9157 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 441/478 places, 444/455 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 443
Applied a total of 2 rules in 16 ms. Remains 440 /441 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 440 cols
[2024-05-22 16:56:06] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:56:06] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 443 rows 440 cols
[2024-05-22 16:56:06] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:56:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-22 16:56:13] [INFO ] Implicit Places using invariants and state equation in 7097 ms returned [301, 306, 327, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2024-05-22 16:56:13] [INFO ] Actually due to overlaps returned [306, 301]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 438/478 places, 443/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 438 /438 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 15 iterations and 153086 ms. Remains : 438/478 places, 443/455 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13928 reset in 115 ms.
Product exploration explored 100000 steps with 13929 reset in 119 ms.
Built C files in :
/tmp/ltsmin12279748433757967784
[2024-05-22 16:56:14] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2024-05-22 16:56:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:56:14] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2024-05-22 16:56:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:56:14] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2024-05-22 16:56:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:56:14] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12279748433757967784
Running compilation step : cd /tmp/ltsmin12279748433757967784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1466 ms.
Running link step : cd /tmp/ltsmin12279748433757967784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12279748433757967784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1783391635023272836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 10 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2024-05-22 16:56:29] [INFO ] Computed 99 invariants in 54 ms
[2024-05-22 16:56:29] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-22 16:56:29] [INFO ] Invariant cache hit.
[2024-05-22 16:56:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:56:38] [INFO ] Implicit Places using invariants and state equation in 8421 ms returned []
Implicit Place search using SMT with State Equation took 8768 ms to find 0 implicit places.
[2024-05-22 16:56:38] [INFO ] Redundant transitions in 5 ms returned []
Running 534 sub problems to find dead transitions.
[2024-05-22 16:56:38] [INFO ] Invariant cache hit.
[2024-05-22 16:56:38] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1093 variables, and 694 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/557 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/557 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/1092 variables, 557/656 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 38/694 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 531/1225 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1093 variables, and 1225 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 97/97 constraints, State Equation: 557/558 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 531/534 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68927 ms. Remains : 558/558 places, 535/535 transitions.
Built C files in :
/tmp/ltsmin7090653980160670129
[2024-05-22 16:57:38] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2024-05-22 16:57:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:57:38] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2024-05-22 16:57:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:57:38] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2024-05-22 16:57:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:57:38] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7090653980160670129
Running compilation step : cd /tmp/ltsmin7090653980160670129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1475 ms.
Running link step : cd /tmp/ltsmin7090653980160670129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7090653980160670129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12083734542743701364.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 16:57:53] [INFO ] Flatten gal took : 17 ms
[2024-05-22 16:57:53] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:57:53] [INFO ] Time to serialize gal into /tmp/LTL11527797309671644865.gal : 3 ms
[2024-05-22 16:57:53] [INFO ] Time to serialize properties into /tmp/LTL17490463208970495203.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11527797309671644865.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18390520742038117494.hoa' '-atoms' '/tmp/LTL17490463208970495203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17490463208970495203.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18390520742038117494.hoa
Detected timeout of ITS tools.
[2024-05-22 16:58:08] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:58:08] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:58:08] [INFO ] Time to serialize gal into /tmp/LTL6286753855066611246.gal : 3 ms
[2024-05-22 16:58:08] [INFO ] Time to serialize properties into /tmp/LTL1463081957457687539.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6286753855066611246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1463081957457687539.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p693>p687)"))||("((p780<2)&&((p399<=p156)||(p938>=3)))")))))
Formula 0 simplified : G(F!"(p693>p687)" & FG!"((p780<2)&&((p399<=p156)||(p938>=3)))")
Detected timeout of ITS tools.
[2024-05-22 16:58:23] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:58:23] [INFO ] Applying decomposition
[2024-05-22 16:58:23] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14886067324805630377.txt' '-o' '/tmp/graph14886067324805630377.bin' '-w' '/tmp/graph14886067324805630377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14886067324805630377.bin' '-l' '-1' '-v' '-w' '/tmp/graph14886067324805630377.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:58:23] [INFO ] Decomposing Gal with order
[2024-05-22 16:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:58:23] [INFO ] Removed a total of 398 redundant transitions.
[2024-05-22 16:58:23] [INFO ] Flatten gal took : 35 ms
[2024-05-22 16:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 21 ms.
[2024-05-22 16:58:24] [INFO ] Time to serialize gal into /tmp/LTL6351971863826023171.gal : 7 ms
[2024-05-22 16:58:24] [INFO ] Time to serialize properties into /tmp/LTL1570951297724038593.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6351971863826023171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1570951297724038593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(gu137.p693>gu137.p687)"))||("((gi0.gu156.p780<2)&&((gu20.p399<=gu20.p156)||(gi0.gu190.p938>=3)))")))))
Formula 0 simplified : G(F!"(gu137.p693>gu137.p687)" & FG!"((gi0.gu156.p780<2)&&((gu20.p399<=gu20.p156)||(gi0.gu190.p938>=3)))")
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-020-LTLCardinality-14 finished in 727919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2024-05-22 16:58:39] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8051400683507551521
[2024-05-22 16:58:39] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2024-05-22 16:58:39] [INFO ] Applying decomposition
[2024-05-22 16:58:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:58:39] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2024-05-22 16:58:39] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:58:39] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9333658197261833825.txt' '-o' '/tmp/graph9333658197261833825.bin' '-w' '/tmp/graph9333658197261833825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9333658197261833825.bin' '-l' '-1' '-v' '-w' '/tmp/graph9333658197261833825.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:58:39] [INFO ] Decomposing Gal with order
[2024-05-22 16:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:58:39] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
[2024-05-22 16:58:39] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 16:58:39] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8051400683507551521
Running compilation step : cd /tmp/ltsmin8051400683507551521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 16:58:39] [INFO ] Removed a total of 283 redundant transitions.
[2024-05-22 16:58:39] [INFO ] Flatten gal took : 77 ms
[2024-05-22 16:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 18 ms.
[2024-05-22 16:58:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality9845281650812620853.gal : 30 ms
[2024-05-22 16:58:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality7437728681713026090.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9845281650812620853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7437728681713026090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("(gi0.gi1.gi1.gi0.gi1.gu208.p490<1)"))))
Formula 0 simplified : FG!"(gi0.gi1.gi1.gi0.gi1.gu208.p490<1)"
Compilation finished in 3365 ms.
Running link step : cd /tmp/ltsmin8051400683507551521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8051400683507551521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8051400683507551521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8051400683507551521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;