About the Execution of ITS-Tools for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5793.987 | 3600000.00 | 3937957.00 | 10563.40 | ? 1 ? 1 ? ? 1 ? 1 ? 1 1 ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900549.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-004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900549
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 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 67K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716387448114
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 14:17:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 14:17:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 14:17:29] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-22 14:17:29] [INFO ] Transformed 216 places.
[2024-05-22 14:17:29] [INFO ] Transformed 198 transitions.
[2024-05-22 14:17:29] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 198 rows 216 cols
[2024-05-22 14:17:29] [INFO ] Computed 24 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
RANDOM walk for 10000 steps (331 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 140006 steps (3945 resets) in 208 ms. (669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 109, 1, 1, 1, 1, 2, +inf, 1, 2, 1]
[2024-05-22 14:17:29] [INFO ] Invariant cache hit.
[2024-05-22 14:17:29] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-22 14:17:29] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 17 ms returned sat
[2024-05-22 14:17:30] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-22 14:17:30] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 18 ms to minimize.
[2024-05-22 14:17:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:30] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:30] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-22 14:17:30] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-22 14:17:30] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 1 ms to minimize.
[2024-05-22 14:17:30] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:17:30] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-22 14:17:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 378 ms
[2024-05-22 14:17:30] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-22 14:17:31] [INFO ] Added : 192 causal constraints over 39 iterations in 871 ms. Result :sat
Minimization took 228 ms.
[2024-05-22 14:17:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:32] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 14:17:32] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-22 14:17:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:32] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:32] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-22 14:17:32] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 3 ms to minimize.
[2024-05-22 14:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-22 14:17:32] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:33] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:17:33] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:17:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-22 14:17:33] [INFO ] Added : 188 causal constraints over 39 iterations in 1056 ms. Result :sat
Minimization took 227 ms.
[2024-05-22 14:17:33] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-22 14:17:33] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-22 14:17:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:17:33] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 14:17:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:34] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:34] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:17:34] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-22 14:17:34] [INFO ] Added : 183 causal constraints over 37 iterations in 718 ms. Result :sat
Minimization took 194 ms.
[2024-05-22 14:17:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:35] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 8 ms returned sat
[2024-05-22 14:17:35] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-22 14:17:35] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:17:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:35] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:35] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:17:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-22 14:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-22 14:17:35] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 14:17:36] [INFO ] Added : 155 causal constraints over 31 iterations in 657 ms. Result :sat
Minimization took 183 ms.
[2024-05-22 14:17:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:36] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:36] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-22 14:17:36] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:17:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:36] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:36] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-22 14:17:36] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-22 14:17:36] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:17:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-22 14:17:36] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-22 14:17:37] [INFO ] Added : 195 causal constraints over 40 iterations in 833 ms. Result :sat
Minimization took 202 ms.
[2024-05-22 14:17:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 14:17:37] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:38] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:17:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:38] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:38] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 14:17:38] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:39] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-22 14:17:39] [INFO ] Added : 196 causal constraints over 40 iterations in 889 ms. Result :sat
Minimization took 200 ms.
[2024-05-22 14:17:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:39] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:39] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 14:17:39] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:39] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:39] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:17:39] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:40] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:17:40] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:17:40] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:17:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2024-05-22 14:17:40] [INFO ] Added : 190 causal constraints over 39 iterations in 1068 ms. Result :sat
Minimization took 216 ms.
[2024-05-22 14:17:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:41] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:41] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:17:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 14:17:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:41] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:41] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-22 14:17:41] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:17:41] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:17:41] [INFO ] Deduced a trap composed of 99 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2024-05-22 14:17:41] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:42] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 4 ms to minimize.
[2024-05-22 14:17:42] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:17:42] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:17:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2024-05-22 14:17:42] [INFO ] Added : 193 causal constraints over 40 iterations in 1085 ms. Result :sat
Minimization took 223 ms.
[2024-05-22 14:17:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:42] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:42] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-22 14:17:43] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 2 ms to minimize.
[2024-05-22 14:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:43] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-22 14:17:43] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-22 14:17:43] [INFO ] Deduced a trap composed of 103 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:17:43] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-22 14:17:43] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2024-05-22 14:17:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 328 ms
[2024-05-22 14:17:43] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 14:17:44] [INFO ] Added : 191 causal constraints over 39 iterations in 781 ms. Result :sat
Minimization took 210 ms.
[2024-05-22 14:17:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned unsat
[2024-05-22 14:17:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:44] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:44] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-22 14:17:44] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-22 14:17:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:44] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2024-05-22 14:17:44] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:17:44] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 2 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2024-05-22 14:17:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 523 ms
[2024-05-22 14:17:45] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 14:17:46] [INFO ] Added : 194 causal constraints over 40 iterations in 834 ms. Result :sat
Minimization took 240 ms.
[2024-05-22 14:17:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:46] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:17:46] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:17:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:46] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 14:17:46] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-22 14:17:47] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:17:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:17:47] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-22 14:17:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2024-05-22 14:17:47] [INFO ] Added : 192 causal constraints over 40 iterations in 1043 ms. Result :sat
Minimization took 207 ms.
[2024-05-22 14:17:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:17:48] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:48] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:17:48] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-22 14:17:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:48] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:17:48] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 2 ms to minimize.
[2024-05-22 14:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-22 14:17:48] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-22 14:17:49] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:17:49] [INFO ] Deduced a trap composed of 108 places in 62 ms of which 1 ms to minimize.
[2024-05-22 14:17:49] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:17:49] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 2 ms to minimize.
[2024-05-22 14:17:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2024-05-22 14:17:49] [INFO ] Added : 187 causal constraints over 38 iterations in 1184 ms. Result :sat
Minimization took 285 ms.
[2024-05-22 14:17:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:50] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-22 14:17:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:17:50] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:17:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:50] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-22 14:17:50] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-22 14:17:50] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
[2024-05-22 14:17:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-22 14:17:50] [INFO ] Computed and/alt/rep : 197/381/197 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 14:17:51] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2024-05-22 14:17:51] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 14:17:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-05-22 14:17:51] [INFO ] Added : 183 causal constraints over 37 iterations in 832 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 109, 1, 1, 1, 1, 1, +inf, 1, 2, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 2, 1]
Support contains 12 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 215 transition count 161
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 178 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 175 transition count 158
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 81 place count 175 transition count 150
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 97 place count 167 transition count 150
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 171 place count 130 transition count 113
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 183 place count 124 transition count 113
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 197 place count 124 transition count 99
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 211 place count 110 transition count 99
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 225 place count 110 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 109 transition count 98
Applied a total of 226 rules in 84 ms. Remains 109 /216 variables (removed 107) and now considering 98/198 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 109/216 places, 98/198 transitions.
Found an invariant !
This invariant on transitions {0=4, 1=4, 20=1, 21=1, 22=1, 23=2, 24=2, 44=1, 45=1, 51=4, 62=1, 65=2, 68=1, 86=1, 91=1, 92=2, 94=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {20=1, 21=1, 22=1, 44=1, 45=1, 62=1, 68=1, 91=1, 94=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 109, 1, 1, 1, 1, +inf, 1, 2, 1]
// Phase 1: matrix 98 rows 109 cols
[2024-05-22 14:17:53] [INFO ] Computed 23 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 25, 1, 1, 1, 1, +inf, 1, 2, 1]
RANDOM walk for 1000000 steps (128144 resets) in 879 ms. (1136 steps per ms)
BEST_FIRST walk for 12000005 steps (1015959 resets) in 6261 ms. (1916 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 25, 1, 1, 1, 1, +inf, 1, 2, 1]
[2024-05-22 14:18:00] [INFO ] Invariant cache hit.
[2024-05-22 14:18:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:00] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-22 14:18:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:00] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 5 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 389 ms
[2024-05-22 14:18:01] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2024-05-22 14:18:01] [INFO ] Added : 62 causal constraints over 14 iterations in 348 ms. Result :sat
Minimization took 93 ms.
[2024-05-22 14:18:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:01] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:02] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:02] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 9 ms.
[2024-05-22 14:18:02] [INFO ] Added : 79 causal constraints over 16 iterations in 228 ms. Result :sat
Minimization took 92 ms.
[2024-05-22 14:18:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:02] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:02] [INFO ] Added : 88 causal constraints over 18 iterations in 275 ms. Result :sat
Minimization took 108 ms.
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 14:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:03] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-22 14:18:03] [INFO ] Added : 77 causal constraints over 16 iterations in 278 ms. Result :sat
Minimization took 93 ms.
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Real]Added 11 Read/Feed constraints in 20 ms returned sat
[2024-05-22 14:18:03] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 7 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-22 14:18:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2024-05-22 14:18:03] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-22 14:18:04] [INFO ] Added : 87 causal constraints over 18 iterations in 248 ms. Result :sat
Minimization took 101 ms.
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Added 11 Read/Feed constraints in 16 ms returned sat
[2024-05-22 14:18:04] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 10 ms.
[2024-05-22 14:18:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 5 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2024-05-22 14:18:04] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 1 ms to minimize.
[2024-05-22 14:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-22 14:18:04] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:04] [INFO ] Added : 60 causal constraints over 13 iterations in 167 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 14:18:05] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-22 14:18:05] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 14:18:05] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-22 14:18:05] [INFO ] Added : 75 causal constraints over 15 iterations in 278 ms. Result :sat
Minimization took 115 ms.
[2024-05-22 14:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Real]Added 11 Read/Feed constraints in 19 ms returned sat
[2024-05-22 14:18:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 14:18:05] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:18:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 14:18:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-22 14:18:06] [INFO ] Added : 88 causal constraints over 19 iterations in 386 ms. Result :sat
Minimization took 98 ms.
[2024-05-22 14:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 5 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Real]Added 11 Read/Feed constraints in 3 ms returned sat
[2024-05-22 14:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 8 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:06] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 422 ms
[2024-05-22 14:18:06] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:06] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:18:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
[2024-05-22 14:18:07] [INFO ] Added : 79 causal constraints over 16 iterations in 448 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:07] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 9 ms.
[2024-05-22 14:18:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 14:18:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2024-05-22 14:18:07] [INFO ] Added : 89 causal constraints over 18 iterations in 363 ms. Result :sat
Minimization took 107 ms.
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 0 ms returned unsat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using 3 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:07] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:08] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:08] [INFO ] [Nat]Absence check using 3 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:08] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:08] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 14:18:08] [INFO ] Computed and/alt/rep : 92/413/92 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 14:18:08] [INFO ] Added : 36 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[+inf, 1, 1, 25, 1, 1, 1, 1, +inf, 1, 1, 1]
FORMULA DoubleExponent-PT-004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 25, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 97
Applied a total of 2 rules in 25 ms. Remains 108 /109 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 108/109 places, 97/98 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 22=1, 42=1, 43=1, 60=1, 66=1, 88=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 22=1, 42=1, 43=1, 60=1, 66=1, 88=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1290 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 25, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 97 rows 108 cols
[2024-05-22 14:18:09] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (128123 resets) in 734 ms. (1360 steps per ms)
BEST_FIRST walk for 11000005 steps (931688 resets) in 5812 ms. (1892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 14:18:15] [INFO ] Invariant cache hit.
[2024-05-22 14:18:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:15] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 14:18:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:16] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-22 14:18:16] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:18:16] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:16] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:18:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-22 14:18:16] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 14:18:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-22 14:18:16] [INFO ] Added : 88 causal constraints over 18 iterations in 300 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 14:18:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:16] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:17] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-22 14:18:17] [INFO ] Added : 64 causal constraints over 13 iterations in 228 ms. Result :sat
Minimization took 88 ms.
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 14:18:17] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2024-05-22 14:18:17] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 9 ms.
[2024-05-22 14:18:17] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 14:18:17] [INFO ] Added : 82 causal constraints over 17 iterations in 267 ms. Result :sat
Minimization took 106 ms.
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:17] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 238 ms
[2024-05-22 14:18:18] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 8 ms.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-22 14:18:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2024-05-22 14:18:18] [INFO ] Added : 90 causal constraints over 18 iterations in 459 ms. Result :sat
Minimization took 106 ms.
[2024-05-22 14:18:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:18:18] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 9 ms.
[2024-05-22 14:18:19] [INFO ] Added : 85 causal constraints over 17 iterations in 220 ms. Result :sat
Minimization took 85 ms.
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:19] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 14:18:19] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:19] [INFO ] Added : 58 causal constraints over 12 iterations in 143 ms. Result :sat
Minimization took 79 ms.
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 14:18:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:19] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 14:18:19] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:20] [INFO ] Added : 75 causal constraints over 15 iterations in 181 ms. Result :sat
Minimization took 85 ms.
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 14:18:20] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:20] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-22 14:18:20] [INFO ] Added : 54 causal constraints over 11 iterations in 189 ms. Result :sat
Minimization took 71 ms.
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:18:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:18:20] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:18:20] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2024-05-22 14:18:20] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 14:18:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 14:18:21] [INFO ] Added : 62 causal constraints over 13 iterations in 227 ms. Result :sat
Minimization took 73 ms.
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:21] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 6 ms.
[2024-05-22 14:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 14:18:21] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:21] [INFO ] Added : 84 causal constraints over 17 iterations in 215 ms. Result :sat
Minimization took 75 ms.
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using 4 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:21] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using 4 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:18:21] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 14:18:22] [INFO ] Computed and/alt/rep : 91/415/91 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:18:22] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-22 14:18:22] [INFO ] Added : 35 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 108/108 places, 97/97 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-22 14:18:22] [INFO ] Invariant cache hit.
[2024-05-22 14:18:22] [INFO ] Implicit Places using invariants in 116 ms returned [28, 47, 54, 60, 75, 80, 98, 105]
[2024-05-22 14:18:22] [INFO ] Actually due to overlaps returned [80, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 120 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 96
Applied a total of 2 rules in 14 ms. Remains 105 /106 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 105 cols
[2024-05-22 14:18:22] [INFO ] Computed 21 invariants in 7 ms
[2024-05-22 14:18:23] [INFO ] Implicit Places using invariants in 73 ms returned [28, 47, 54, 60, 95, 102]
[2024-05-22 14:18:23] [INFO ] Actually due to overlaps returned [102, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/108 places, 96/97 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 103 transition count 96
Applied a total of 1 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 103 cols
[2024-05-22 14:18:23] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 14:18:23] [INFO ] Implicit Places using invariants in 65 ms returned [28, 47, 54, 60]
[2024-05-22 14:18:23] [INFO ] Actually due to overlaps returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 102/108 places, 96/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 295 ms. Remains : 102/108 places, 96/97 transitions.
Found an invariant !
This invariant on transitions {0=1, 1=1, 8=2, 9=2, 10=2, 13=2, 20=1, 21=1, 23=1, 35=2, 41=1, 45=1, 54=1, 57=1, 64=1, 78=1, 80=1, 82=2, 83=1, 84=1, 85=1, 86=1, 91=1, 93=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {20=1, 21=1, 41=1, 56=1, 62=1, 84=1, 87=1, 93=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 11, 1, 1, 1, 1, +inf, 1, 1]
// Phase 1: matrix 96 rows 102 cols
[2024-05-22 14:18:23] [INFO ] Computed 18 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144120 resets) in 694 ms. (1438 steps per ms)
BEST_FIRST walk for 11000004 steps (1005227 resets) in 5410 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 14:18:29] [INFO ] Invariant cache hit.
[2024-05-22 14:18:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:29] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:29] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 17 ms returned sat
[2024-05-22 14:18:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 14:18:29] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:29] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 286 ms
[2024-05-22 14:18:29] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:18:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-22 14:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-22 14:18:30] [INFO ] Added : 70 causal constraints over 14 iterations in 243 ms. Result :sat
Minimization took 108 ms.
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:30] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:30] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 14:18:30] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 14:18:30] [INFO ] Added : 65 causal constraints over 14 iterations in 261 ms. Result :sat
Minimization took 78 ms.
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:30] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:30] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 14:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:18:31] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 14:18:31] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 14:18:31] [INFO ] Added : 90 causal constraints over 20 iterations in 362 ms. Result :sat
Minimization took 113 ms.
[2024-05-22 14:18:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Real]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 14:18:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:31] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:31] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 14:18:31] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 9 ms.
[2024-05-22 14:18:32] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 14:18:32] [INFO ] Added : 92 causal constraints over 19 iterations in 354 ms. Result :sat
Minimization took 94 ms.
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:32] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:18:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-22 14:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 14:18:32] [INFO ] Added : 92 causal constraints over 19 iterations in 344 ms. Result :sat
Minimization took 151 ms.
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Real]Added 11 Read/Feed constraints in 4 ms returned sat
[2024-05-22 14:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:32] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:33] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-22 14:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 14:18:33] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:18:33] [INFO ] Added : 43 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 57 ms.
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2024-05-22 14:18:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 14:18:33] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:18:33] [INFO ] Added : 90 causal constraints over 19 iterations in 339 ms. Result :sat
Minimization took 84 ms.
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:33] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-22 14:18:34] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 7 ms.
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 14:18:34] [INFO ] Added : 85 causal constraints over 17 iterations in 305 ms. Result :sat
Minimization took 94 ms.
[2024-05-22 14:18:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 14:18:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 14:18:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 372 ms
[2024-05-22 14:18:35] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 8 ms.
[2024-05-22 14:18:35] [INFO ] Added : 89 causal constraints over 19 iterations in 270 ms. Result :sat
Minimization took 99 ms.
[2024-05-22 14:18:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:35] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 14:18:35] [INFO ] Added : 92 causal constraints over 19 iterations in 278 ms. Result :sat
Minimization took 100 ms.
[2024-05-22 14:18:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Real]Absence check using 8 positive and 10 generalized place invariants in 4 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Nat]Absence check using 8 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:18:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:18:36] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 14:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 14:18:36] [INFO ] Computed and/alt/rep : 92/420/92 causal constraints (skipped 3 transitions) in 4 ms.
[2024-05-22 14:18:36] [INFO ] Added : 37 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-22 14:18:36] [INFO ] Invariant cache hit.
[2024-05-22 14:18:36] [INFO ] Implicit Places using invariants in 71 ms returned [46, 53, 59]
[2024-05-22 14:18:36] [INFO ] Actually due to overlaps returned [46, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/102 places, 96/96 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 95
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 3 place count 99 transition count 95
Applied a total of 3 rules in 8 ms. Remains 99 /100 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:18:36] [INFO ] Computed 16 invariants in 2 ms
[2024-05-22 14:18:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:18:37] [INFO ] Invariant cache hit.
[2024-05-22 14:18:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:37] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/102 places, 95/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 322 ms. Remains : 99/102 places, 95/96 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 40=1, 55=1, 61=1, 82=1, 85=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {20=1, 21=1, 40=1, 55=1, 61=1, 82=1, 85=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 14:18:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 1000000 steps (144591 resets) in 687 ms. (1453 steps per ms)
BEST_FIRST walk for 11000001 steps (1005935 resets) in 5356 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
[2024-05-22 14:18:43] [INFO ] Invariant cache hit.
[2024-05-22 14:18:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:43] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-22 14:18:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:43] [INFO ] [Real]Added 11 Read/Feed constraints in 23 ms returned sat
[2024-05-22 14:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:43] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 14:18:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:43] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 14:18:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:18:43] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-22 14:18:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 735 ms
[2024-05-22 14:18:44] [INFO ] Added : 86 causal constraints over 18 iterations in 950 ms. Result :sat
Minimization took 161 ms.
[2024-05-22 14:18:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:44] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 14:18:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:44] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:45] [INFO ] Added : 90 causal constraints over 18 iterations in 264 ms. Result :sat
Minimization took 94 ms.
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:18:45] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 14:18:45] [INFO ] Added : 84 causal constraints over 17 iterations in 200 ms. Result :sat
Minimization took 102 ms.
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 22 ms returned sat
[2024-05-22 14:18:45] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:46] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-05-22 14:18:46] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-22 14:18:46] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:46] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 14:18:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2024-05-22 14:18:46] [INFO ] Added : 85 causal constraints over 17 iterations in 472 ms. Result :sat
Minimization took 114 ms.
[2024-05-22 14:18:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Real]Added 11 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 14:18:46] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 14:18:46] [INFO ] Added : 77 causal constraints over 16 iterations in 202 ms. Result :sat
Minimization took 82 ms.
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Added 11 Read/Feed constraints in 14 ms returned sat
[2024-05-22 14:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:47] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 14:18:47] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:47] [INFO ] Added : 44 causal constraints over 9 iterations in 108 ms. Result :sat
Minimization took 65 ms.
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Added 11 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2024-05-22 14:18:47] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:47] [INFO ] Added : 90 causal constraints over 18 iterations in 311 ms. Result :sat
Minimization took 101 ms.
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:18:48] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:48] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 14:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-22 14:18:48] [INFO ] Added : 50 causal constraints over 10 iterations in 167 ms. Result :sat
Minimization took 67 ms.
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:18:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:18:48] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-22 14:18:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-22 14:18:48] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 14:18:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-22 14:18:48] [INFO ] Added : 61 causal constraints over 13 iterations in 210 ms. Result :sat
Minimization took 103 ms.
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:18:48] [INFO ] [Real]Added 11 Read/Feed constraints in 12 ms returned sat
[2024-05-22 14:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2024-05-22 14:18:49] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 14:18:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 14:18:49] [INFO ] Added : 91 causal constraints over 19 iterations in 342 ms. Result :sat
Minimization took 174 ms.
[2024-05-22 14:18:49] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:18:49] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-22 14:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:18:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:18:49] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 14:18:49] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:18:49] [INFO ] Added : 40 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
Support contains 11 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 99/99 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-22 14:18:50] [INFO ] Invariant cache hit.
[2024-05-22 14:18:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 14:18:50] [INFO ] Invariant cache hit.
[2024-05-22 14:18:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:18:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 14:18:50] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-22 14:18:50] [INFO ] Invariant cache hit.
[2024-05-22 14:18:50] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 2/97 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:51] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-22 14:18:51] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:51] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:18:51] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:18:52] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:52] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-22 14:18:52] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 2/99 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:52] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 95/194 variables, 99/123 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:54] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:54] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/194 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:54] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:18:55] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:56] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:56] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:56] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:18:56] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 19 (OVERLAPS) 0/194 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 148 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6547 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 2/97 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:57] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 2/99 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 95/194 variables, 99/138 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 94/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:18:59] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:18:59] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-22 14:19:01] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:19:01] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/194 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (OVERLAPS) 0/194 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 247 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6938 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 27/27 constraints]
After SMT, in 13535ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 13545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13804 ms. Remains : 99/99 places, 95/95 transitions.
Found an invariant !
This invariant on transitions {20=1, 21=1, 40=1, 55=1, 61=1, 82=1, 85=1, 91=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {20=1, 21=1, 40=1, 55=1, 61=1, 82=1, 85=1, 91=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 6, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 40000 steps (5757 resets) in 1079 ms. (37 steps per ms) remains 20/20 properties
[2024-05-22 14:19:04] [INFO ] Flatten gal took : 94 ms
BEST_FIRST walk for 4002 steps (373 resets) in 81 ms. (48 steps per ms) remains 20/20 properties
[2024-05-22 14:19:04] [INFO ] Flatten gal took : 31 ms
BEST_FIRST walk for 4002 steps (347 resets) in 71 ms. (55 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (348 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
[2024-05-22 14:19:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1299162252626289734.gal : 14 ms
BEST_FIRST walk for 4002 steps (362 resets) in 71 ms. (55 steps per ms) remains 20/20 properties
[2024-05-22 14:19:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1300080652603501840.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1299162252626289734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1300080652603501840.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (358 resets) in 79 ms. (50 steps per ms) remains 20/20 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1300080652603501840.prop.
BEST_FIRST walk for 4002 steps (352 resets) in 76 ms. (51 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :14 after 26
BEST_FIRST walk for 4001 steps (341 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :26 after 40
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :40 after 91
Invariant property MIN10 does not hold.
Reachability property MAX10 is true.
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :91 after 278
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :278 after 551
BEST_FIRST walk for 4002 steps (378 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :551 after 1171
BEST_FIRST walk for 4000 steps (363 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (368 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
SDD proceeding with computation,18 properties remain. new max is 2048
SDD size :1171 after 12175
BEST_FIRST walk for 4000 steps (369 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
BEST_FIRST walk for 4001 steps (360 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :12175 after 79998
BEST_FIRST walk for 4000 steps (361 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (384 resets) in 28 ms. (137 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (347 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (360 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :79998 after 149919
BEST_FIRST walk for 4000 steps (355 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (372 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (367 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (360 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :149919 after 308494
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :308494 after 614225
Invariant property MIN9 does not hold.
Reachability property MAX9 is true.
Invariant property MIN8 does not hold.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :7.62903e+06 after 8.36576e+06
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2.19411e+07 after 2.25667e+07
Interrupted probabilistic random walk after 193444 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :6 out of 20
Probabilistic random walk after 193444 steps, saw 96750 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :6
[2024-05-22 14:19:08] [INFO ] Invariant cache hit.
[2024-05-22 14:19:08] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 14:19:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX3 is UNSAT
At refinement iteration 4 (OVERLAPS) 25/95 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 95/190 variables, 95/110 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 11/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/194 variables, 4/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 2/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 127 constraints, problems are : Problem set: 1 solved, 5 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 25/95 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 95/190 variables, 95/110 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 11/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 5/126 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/194 variables, 4/130 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 2/132 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/194 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 132 constraints, problems are : Problem set: 1 solved, 5 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 448ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :5.47657e+07 after 5.47988e+07
Parikh walk visited 0 properties in 1854 ms.
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 95 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 94 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 90 transition count 88
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 90 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 88 transition count 86
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 88 transition count 86
Applied a total of 23 rules in 12 ms. Remains 88 /99 variables (removed 11) and now considering 86/95 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 88/99 places, 86/95 transitions.
RANDOM walk for 40000 steps (5750 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3700 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3651 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3695 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3636 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :1.21866e+08 after 1.24945e+08
Interrupted probabilistic random walk after 321322 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 5
Probabilistic random walk after 321322 steps, saw 160727 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 86 rows 88 cols
[2024-05-22 14:19:13] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 14:19:13] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 14:19:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 19/84 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 14:19:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:19:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 86/170 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/174 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 119 constraints, problems are : Problem set: 0 solved, 5 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 19/84 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 86/170 variables, 84/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/174 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 124 constraints, problems are : Problem set: 0 solved, 5 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1650 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-22 14:19:16] [INFO ] Invariant cache hit.
[2024-05-22 14:19:16] [INFO ] Implicit Places using invariants in 74 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/88 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Applied a total of 2 rules in 5 ms. Remains 86 /87 variables (removed 1) and now considering 85/86 (removed 1) transitions.
// Phase 1: matrix 85 rows 86 cols
[2024-05-22 14:19:16] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 14:19:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:19:16] [INFO ] Invariant cache hit.
[2024-05-22 14:19:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:19:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 86/88 places, 85/86 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 295 ms. Remains : 86/88 places, 85/86 transitions.
RANDOM walk for 40000 steps (5736 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3660 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (3692 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3590 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 360697 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 5
Probabilistic random walk after 360697 steps, saw 180392 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-22 14:19:19] [INFO ] Invariant cache hit.
[2024-05-22 14:19:19] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 14:19:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 20/82 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 14:19:19] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:19:19] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 85/167 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/171 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/171 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 116 constraints, problems are : Problem set: 0 solved, 5 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 20/82 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 85/167 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/171 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 121 constraints, problems are : Problem set: 0 solved, 5 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1617 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-22 14:19:21] [INFO ] Invariant cache hit.
[2024-05-22 14:19:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:19:21] [INFO ] Invariant cache hit.
[2024-05-22 14:19:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:19:21] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-22 14:19:21] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2024-05-22 14:19:21] [INFO ] Invariant cache hit.
[2024-05-22 14:19:21] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 2/86 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 85/171 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-22 14:19:23] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:19:23] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/171 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 115 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :2.66114e+08 after 2.74429e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 2/86 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/171 variables, 86/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 13/115 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 84/199 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-22 14:19:25] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:19:25] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:19:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:19:25] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 5520ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 5531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5768 ms. Remains : 86/86 places, 85/85 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 86 transition count 78
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 79 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 76 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 76 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 75 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 75 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 74 transition count 73
Applied a total of 24 rules in 21 ms. Remains 74 /86 variables (removed 12) and now considering 73/85 (removed 12) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 73 rows 74 cols
[2024-05-22 14:19:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 14:19:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:19:27] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:19:27] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-22 14:19:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:19:27] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 14:19:27] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 14:19:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:19:27] [INFO ] [Nat]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:19:27] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 14:19:27] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-22 14:19:27] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-22 14:19:27] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-22 14:19:27] [INFO ] Flatten gal took : 22 ms
[2024-05-22 14:19:27] [INFO ] Flatten gal took : 14 ms
[2024-05-22 14:19:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11109914502828467605.gal : 4 ms
[2024-05-22 14:19:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality993002042074314579.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11109914502828467605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality993002042074314579.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality993002042074314579.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :87 after 162
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :162 after 306
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :306 after 632
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :632 after 1411
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1411 after 3167
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2024-05-22 14:19:42] [INFO ] Flatten gal took : 12 ms
[2024-05-22 14:19:42] [INFO ] Applying decomposition
[2024-05-22 14:19:42] [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/graph13798453973032902560.txt' '-o' '/tmp/graph13798453973032902560.bin' '-w' '/tmp/graph13798453973032902560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13798453973032902560.bin' '-l' '-1' '-v' '-w' '/tmp/graph13798453973032902560.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:19:42] [INFO ] Decomposing Gal with order
[2024-05-22 14:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:19:43] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 14:19:43] [INFO ] Flatten gal took : 53 ms
[2024-05-22 14:19:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 15 ms.
[2024-05-22 14:19:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1785615871843362872.gal : 13 ms
[2024-05-22 14:19:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3823706360091718380.prop : 7 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1785615871843362872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3823706360091718380.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3823706360091718380.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :78 after 78
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :188 after 201
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :443 after 553
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :5968 after 6263
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :55185 after 57106
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :5.8725e+08 after 5.87252e+08
Detected timeout of ITS tools.
[2024-05-22 14:19:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:19:55] [INFO ] Applying decomposition
[2024-05-22 14:19:55] [INFO ] Flatten gal took : 7 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/graph11173011748289931766.txt' '-o' '/tmp/graph11173011748289931766.bin' '-w' '/tmp/graph11173011748289931766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11173011748289931766.bin' '-l' '-1' '-v' '-w' '/tmp/graph11173011748289931766.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:19:55] [INFO ] Decomposing Gal with order
[2024-05-22 14:19:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:19:55] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-22 14:19:55] [INFO ] Flatten gal took : 12 ms
[2024-05-22 14:19:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2024-05-22 14:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12932015091000791237.gal : 3 ms
[2024-05-22 14:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9091880788642245969.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12932015091000791237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9091880788642245969.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9091880788642245969.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :16 after 21
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :42 after 47
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :47 after 59
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :498 after 521
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :90603 after 90611
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30673 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DoubleExponent-PT-004-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-004-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 1, 6, 1, +inf]
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:19:58] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1424 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (921 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:19:58] [INFO ] Invariant cache hit.
[2024-05-22 14:19:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 14:19:58] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:19:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 14:19:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:19:58] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:19:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:19:58] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:19:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:19:58] [INFO ] [Nat]Added 11 Read/Feed constraints in 16 ms returned sat
[2024-05-22 14:19:58] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:19:58] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 0 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:19:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 662 ms
[2024-05-22 14:19:59] [INFO ] Added : 86 causal constraints over 18 iterations in 904 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 97 transition count 94
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 97 transition count 92
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 95 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 16 place count 90 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 90 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 87 transition count 84
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 87 transition count 84
Applied a total of 25 rules in 9 ms. Remains 87 /99 variables (removed 12) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 87/99 places, 84/95 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 21=1, 32=1, 38=1, 56=1, 59=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 21=1, 32=1, 38=1, 56=1, 59=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-22 14:20:01] [INFO ] Computed 15 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144479 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 1000001 steps (91346 resets) in 426 ms. (2341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:20:02] [INFO ] Invariant cache hit.
[2024-05-22 14:20:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:02] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:20:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:20:03] [INFO ] [Real]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:20:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:20:03] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:20:03] [INFO ] [Nat]Added 14 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:20:03] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 14:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-22 14:20:03] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 14:20:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-22 14:20:03] [INFO ] Added : 61 causal constraints over 13 iterations in 274 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:20:03] [INFO ] Invariant cache hit.
[2024-05-22 14:20:03] [INFO ] Implicit Places using invariants in 66 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 4 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-22 14:20:03] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 14:20:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:20:03] [INFO ] Invariant cache hit.
[2024-05-22 14:20:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:20:03] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 232 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 5 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 14:20:03] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 14:20:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 14:20:03] [INFO ] Invariant cache hit.
[2024-05-22 14:20:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:20:04] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 516 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:20:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144393 resets) in 599 ms. (1666 steps per ms)
BEST_FIRST walk for 1000001 steps (91478 resets) in 428 ms. (2331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:20:05] [INFO ] Invariant cache hit.
[2024-05-22 14:20:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:05] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:20:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:20:05] [INFO ] [Real]Added 14 Read/Feed constraints in 10 ms returned sat
[2024-05-22 14:20:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:05] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:20:05] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:20:05] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-22 14:20:05] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 5 ms.
[2024-05-22 14:20:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:20:06] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:20:06] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:20:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:20:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 213 ms
[2024-05-22 14:20:06] [INFO ] Added : 55 causal constraints over 12 iterations in 340 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:20:06] [INFO ] Invariant cache hit.
[2024-05-22 14:20:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 14:20:06] [INFO ] Invariant cache hit.
[2024-05-22 14:20:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:20:06] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 14:20:06] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 14:20:06] [INFO ] Invariant cache hit.
[2024-05-22 14:20:06] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:20:09] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:20:11] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-22 14:20:11] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:20:13] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/163 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:20:13] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:20:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 200 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints]
After SMT, in 9796ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 9801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10023 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40000 steps (5746 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
[2024-05-22 14:20:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10076244702590503858.gal : 2 ms
[2024-05-22 14:20:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17678942548919590653.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10076244702590503858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17678942548919590653.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (3677 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17678942548919590653.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :91 after 286
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :286 after 810
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :810 after 4799
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4799 after 38466
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :38466 after 201416
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :201416 after 569467
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.96947e+07,1.29995,38280,2,34697,20,146386,6,0,408,111026,0
Total reachable state count : 59694704
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,28,1.30217,38280,2,322,20,146386,7,0,411,111026,0
Interrupted probabilistic random walk after 1406456 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1406456 steps, saw 703239 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-00 in 21588 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:20:19] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1426 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (935 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:20:19] [INFO ] Invariant cache hit.
[2024-05-22 14:20:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:19] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:20:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:20:19] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:20:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:19] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:19] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:20:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:20:19] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 14:20:20] [INFO ] Added : 84 causal constraints over 17 iterations in 193 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 99 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p197) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 94/94 transitions.
Graph (complete) has 330 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 95 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 93 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 93 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 92 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 88 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 88 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 85 transition count 81
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 26 place count 85 transition count 81
Applied a total of 26 rules in 9 ms. Remains 85 /99 variables (removed 14) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/99 places, 81/94 transitions.
// Phase 1: matrix 81 rows 85 cols
[2024-05-22 14:20:20] [INFO ] Computed 16 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144195 resets) in 622 ms. (1605 steps per ms)
BEST_FIRST walk for 1000000 steps (91289 resets) in 442 ms. (2257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:20:21] [INFO ] Invariant cache hit.
[2024-05-22 14:20:21] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-22 14:20:21] [INFO ] [Real]Absence check using 7 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 14:20:21] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:20:21] [INFO ] [Real]Added 13 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:20:21] [INFO ] Computed and/alt/rep : 79/446/79 causal constraints (skipped 1 transitions) in 5 ms.
[2024-05-22 14:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:21] [INFO ] [Nat]Absence check using 7 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:21] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-22 14:20:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:20:21] [INFO ] Computed and/alt/rep : 79/446/79 causal constraints (skipped 1 transitions) in 6 ms.
[2024-05-22 14:20:21] [INFO ] Added : 74 causal constraints over 16 iterations in 201 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:20:21] [INFO ] Invariant cache hit.
[2024-05-22 14:20:21] [INFO ] Implicit Places using invariants in 64 ms returned [20, 39, 43]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/85 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 82 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 78 transition count 77
Applied a total of 8 rules in 4 ms. Remains 78 /82 variables (removed 4) and now considering 77/81 (removed 4) transitions.
// Phase 1: matrix 77 rows 78 cols
[2024-05-22 14:20:21] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 14:20:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 14:20:21] [INFO ] Invariant cache hit.
[2024-05-22 14:20:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:20:22] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 77/85 places, 77/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 286 ms. Remains : 77/85 places, 77/81 transitions.
// Phase 1: matrix 77 rows 77 cols
[2024-05-22 14:20:22] [INFO ] Computed 12 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144168 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 1000000 steps (91823 resets) in 435 ms. (2293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:20:23] [INFO ] Invariant cache hit.
[2024-05-22 14:20:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:23] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 14:20:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:20:23] [INFO ] [Real]Added 13 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:23] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:23] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 14:20:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-22 14:20:23] [INFO ] Computed and/alt/rep : 75/432/75 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 14:20:23] [INFO ] Added : 74 causal constraints over 15 iterations in 251 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-22 14:20:23] [INFO ] Invariant cache hit.
[2024-05-22 14:20:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 14:20:23] [INFO ] Invariant cache hit.
[2024-05-22 14:20:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:20:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-22 14:20:23] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-22 14:20:23] [INFO ] Invariant cache hit.
[2024-05-22 14:20:23] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-22 14:20:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 179 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints]
After SMT, in 3734ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3736ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3930 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5792 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-05-22 14:20:27] [INFO ] Flatten gal took : 17 ms
[2024-05-22 14:20:27] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3014764943324100572.gal : 2 ms
[2024-05-22 14:20:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16892157198378177820.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3014764943324100572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16892157198378177820.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3612 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16892157198378177820.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 275
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :275 after 812
BEST_FIRST walk for 40002 steps (3733 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :812 after 6347
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6347 after 48059
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :48059 after 236082
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :236082 after 643048
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748076 after 1.64239e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.64239e+06 after 1.45954e+07
Interrupted probabilistic random walk after 545106 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 545106 steps, saw 272619 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-22 14:20:30] [INFO ] Invariant cache hit.
[2024-05-22 14:20:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:30] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:20:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 14:20:31] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-22 14:20:31] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 77/77 places, 77/77 transitions.
RANDOM walk for 40000 steps (5742 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3706 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3695 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.45954e+07 after 8.24312e+07
Interrupted probabilistic random walk after 579769 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 2
Probabilistic random walk after 579769 steps, saw 289948 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
[2024-05-22 14:20:34] [INFO ] Invariant cache hit.
[2024-05-22 14:20:34] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/72 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 77/149 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/154 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:20:34] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 77/149 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/149 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/154 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 165 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 9 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 77/77 places, 77/77 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-22 14:20:35] [INFO ] Invariant cache hit.
[2024-05-22 14:20:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 14:20:35] [INFO ] Invariant cache hit.
[2024-05-22 14:20:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 14:20:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-22 14:20:35] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-22 14:20:35] [INFO ] Invariant cache hit.
[2024-05-22 14:20:35] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/77 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/154 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 76/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-22 14:20:37] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/154 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 179 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2591 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints]
After SMT, in 3780ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3970 ms. Remains : 77/77 places, 77/77 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 77 transition count 71
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 71 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 68 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 68 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 67 transition count 67
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 67 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 65 transition count 65
Applied a total of 24 rules in 11 ms. Remains 65 /77 variables (removed 12) and now considering 65/77 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 65 cols
[2024-05-22 14:20:39] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 14:20:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:39] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:39] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 14:20:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:20:39] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 14:20:39] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-22 14:20:39] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2024-05-22 14:20:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:20:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2913334703407832762.gal : 1 ms
[2024-05-22 14:20:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1260944496212883713.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2913334703407832762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1260944496212883713.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1260944496212883713.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 152
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :152 after 292
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :292 after 576
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :576 after 1423
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1423 after 3251
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3251 after 6877
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6877 after 14126
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :14126 after 28632
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :28632 after 57613
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :57613 after 115573
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :8.24312e+07 after 2.15607e+08
Detected timeout of ITS tools.
[2024-05-22 14:20:54] [INFO ] Flatten gal took : 24 ms
[2024-05-22 14:20:54] [INFO ] Applying decomposition
[2024-05-22 14:20:54] [INFO ] Flatten gal took : 5 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/graph5861122478776527818.txt' '-o' '/tmp/graph5861122478776527818.bin' '-w' '/tmp/graph5861122478776527818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5861122478776527818.bin' '-l' '-1' '-v' '-w' '/tmp/graph5861122478776527818.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:20:54] [INFO ] Decomposing Gal with order
[2024-05-22 14:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:20:54] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 14:20:54] [INFO ] Flatten gal took : 15 ms
[2024-05-22 14:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2024-05-22 14:20:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12429671692588915985.gal : 22 ms
[2024-05-22 14:20:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17052662619817765365.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12429671692588915985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17052662619817765365.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17052662619817765365.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30314 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 14:21:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:21:09] [INFO ] Applying decomposition
[2024-05-22 14:21:09] [INFO ] Flatten gal took : 5 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/graph290815039120129313.txt' '-o' '/tmp/graph290815039120129313.bin' '-w' '/tmp/graph290815039120129313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph290815039120129313.bin' '-l' '-1' '-v' '-w' '/tmp/graph290815039120129313.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:21:09] [INFO ] Decomposing Gal with order
[2024-05-22 14:21:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:21:09] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 14:21:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 14:21:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2024-05-22 14:21:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2359822697685373796.gal : 3 ms
[2024-05-22 14:21:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12340602706322216569.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2359822697685373796.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12340602706322216569.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12340602706322216569.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 33
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1178
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :747052 after 747119
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747119 after 747275
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :747275 after 747565
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :747565 after 748120
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :748120 after 749205
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :749205 after 751335
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :751335 after 755543
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :755543 after 763898
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :763898 after 780507
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-02 in 99917 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:21:59] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1460 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (898 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 14:21:59] [INFO ] Invariant cache hit.
[2024-05-22 14:21:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:21:59] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:21:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-22 14:21:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:21:59] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:21:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:21:59] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:21:59] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:21:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 21 ms returned sat
[2024-05-22 14:21:59] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:22:00] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:22:00] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 14:22:00] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 14:22:00] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-22 14:22:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2024-05-22 14:22:00] [INFO ] Added : 85 causal constraints over 17 iterations in 503 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 94 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 94 transition count 92
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 93 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 88 transition count 87
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 88 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 86 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 86 transition count 85
Applied a total of 25 rules in 9 ms. Remains 86 /99 variables (removed 13) and now considering 85/95 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/99 places, 85/95 transitions.
// Phase 1: matrix 85 rows 86 cols
[2024-05-22 14:22:00] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144168 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 1000001 steps (91362 resets) in 433 ms. (2304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 14:22:01] [INFO ] Invariant cache hit.
[2024-05-22 14:22:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 14:22:01] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 14:22:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:22:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:01] [INFO ] [Real]Added 14 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:22:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:22:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 14:22:01] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 14:22:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-22 14:22:01] [INFO ] [Nat]Added 14 Read/Feed constraints in 13 ms returned sat
[2024-05-22 14:22:01] [INFO ] Computed and/alt/rep : 81/464/81 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:22:02] [INFO ] Added : 79 causal constraints over 18 iterations in 301 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-22 14:22:02] [INFO ] Invariant cache hit.
[2024-05-22 14:22:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 14:22:02] [INFO ] Invariant cache hit.
[2024-05-22 14:22:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:02] [INFO ] Implicit Places using invariants and state equation in 193 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 277 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Applied a total of 2 rules in 4 ms. Remains 84 /85 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-05-22 14:22:02] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 14:22:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 14:22:02] [INFO ] Invariant cache hit.
[2024-05-22 14:22:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:02] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 84/85 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 600 ms. Remains : 84/86 places, 84/85 transitions.
[2024-05-22 14:22:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (144452 resets) in 623 ms. (1602 steps per ms)
BEST_FIRST walk for 1000001 steps (91417 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 14:22:03] [INFO ] Invariant cache hit.
[2024-05-22 14:22:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:22:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:03] [INFO ] [Real]Added 14 Read/Feed constraints in 8 ms returned sat
[2024-05-22 14:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:22:03] [INFO ] Computed and/alt/rep : 80/459/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:22:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 14:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-22 14:22:04] [INFO ] Added : 75 causal constraints over 16 iterations in 294 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:22:04] [INFO ] Invariant cache hit.
[2024-05-22 14:22:04] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 14:22:04] [INFO ] Invariant cache hit.
[2024-05-22 14:22:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:04] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-22 14:22:04] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-22 14:22:04] [INFO ] Invariant cache hit.
[2024-05-22 14:22:04] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5174ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5505 ms. Remains : 84/84 places, 84/84 transitions.
[2024-05-22 14:22:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:22:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:22:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality594349179460306246.gal : 2 ms
[2024-05-22 14:22:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2545023863669656855.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality594349179460306246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2545023863669656855.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2545023863669656855.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 275
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :275 after 806
RANDOM walk for 40000 steps (5687 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :806 after 4799
BEST_FIRST walk for 40001 steps (3634 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4799 after 37157
BEST_FIRST walk for 40002 steps (3667 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :37157 after 190849
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :190849 after 546738
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748076 after 7.93299e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.93299e+06 after 3.71651e+08
Interrupted probabilistic random walk after 586206 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 2
Probabilistic random walk after 586206 steps, saw 293166 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-22 14:22:13] [INFO ] Invariant cache hit.
[2024-05-22 14:22:13] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 1 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 14:22:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 1 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 232ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 84/84 places, 84/84 transitions.
RANDOM walk for 40000 steps (5767 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3600 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1418814 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 1
Probabilistic random walk after 1418814 steps, saw 709422 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2024-05-22 14:22:16] [INFO ] Invariant cache hit.
[2024-05-22 14:22:16] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/167 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 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) 30/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:22:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/72 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/154 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/167 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
SDD proceeding with computation,2 properties remain. new max is 131072
Applied a total of 0 rules in 13 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
SDD size :3.71651e+08 after 2.24898e+09
Applied a total of 0 rules in 12 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:22:16] [INFO ] Invariant cache hit.
[2024-05-22 14:22:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 14:22:16] [INFO ] Invariant cache hit.
[2024-05-22 14:22:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:22:16] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-22 14:22:16] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-22 14:22:16] [INFO ] Invariant cache hit.
[2024-05-22 14:22:16] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 83/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 5370ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5660 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 6 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2024-05-22 14:22:22] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 14:22:22] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:22:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 14:22:22] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-22 14:22:22] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 14:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:22:22] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:22:22] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:22:22] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:22:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:22:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:22:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13814050074271530193.gal : 1 ms
[2024-05-22 14:22:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11281252401123273538.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13814050074271530193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11281252401123273538.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11281252401123273538.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :87 after 162
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :162 after 306
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :306 after 632
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :632 after 1411
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1411 after 3167
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :54782 after 109861
Detected timeout of ITS tools.
[2024-05-22 14:22:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:22:37] [INFO ] Applying decomposition
[2024-05-22 14:22:37] [INFO ] Flatten gal took : 5 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/graph6607440814525333398.txt' '-o' '/tmp/graph6607440814525333398.bin' '-w' '/tmp/graph6607440814525333398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6607440814525333398.bin' '-l' '-1' '-v' '-w' '/tmp/graph6607440814525333398.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:22:37] [INFO ] Decomposing Gal with order
[2024-05-22 14:22:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:22:37] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-22 14:22:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:22:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 14:22:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9079117281851940180.gal : 1 ms
[2024-05-22 14:22:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11595640586647856050.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9079117281851940180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11595640586647856050.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11595640586647856050.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :196 after 199
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :574 after 577
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24899 after 25064
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.24898e+09 after 6.91801e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30231 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 14:22:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 14:22:52] [INFO ] Applying decomposition
[2024-05-22 14:22:52] [INFO ] Flatten gal took : 5 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/graph4434996276300195441.txt' '-o' '/tmp/graph4434996276300195441.bin' '-w' '/tmp/graph4434996276300195441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4434996276300195441.bin' '-l' '-1' '-v' '-w' '/tmp/graph4434996276300195441.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:22:52] [INFO ] Decomposing Gal with order
[2024-05-22 14:22:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:22:52] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 14:22:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 14:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2024-05-22 14:22:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5394162676133587823.gal : 1 ms
[2024-05-22 14:22:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5550626168884415428.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5394162676133587823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5550626168884415428.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5550626168884415428.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34 after 41
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :41 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :188 after 210
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1142 after 1174
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-04 in 102920 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:23:42] [INFO ] Computed 16 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1452 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10000 steps (911 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:23:42] [INFO ] Invariant cache hit.
[2024-05-22 14:23:42] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 14:23:42] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:23:42] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 14:23:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:23:42] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:23:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:23:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 40 ms returned sat
[2024-05-22 14:23:42] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 58 ms returned sat
[2024-05-22 14:23:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:23:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2024-05-22 14:23:42] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 14:23:43] [INFO ] Added : 77 causal constraints over 16 iterations in 208 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 95 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 95 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 94 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 89 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 89 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 86 transition count 84
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 26 place count 86 transition count 84
Applied a total of 26 rules in 7 ms. Remains 86 /99 variables (removed 13) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/99 places, 84/95 transitions.
// Phase 1: matrix 84 rows 86 cols
[2024-05-22 14:23:43] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144312 resets) in 618 ms. (1615 steps per ms)
BEST_FIRST walk for 1000000 steps (91162 resets) in 442 ms. (2257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:23:44] [INFO ] Invariant cache hit.
[2024-05-22 14:23:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 14:23:44] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:23:44] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:23:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:23:44] [INFO ] [Real]Added 14 Read/Feed constraints in 11 ms returned sat
[2024-05-22 14:23:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:23:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:23:44] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:23:44] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:23:44] [INFO ] [Nat]Added 14 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:23:44] [INFO ] Computed and/alt/rep : 80/463/80 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:23:44] [INFO ] Added : 62 causal constraints over 13 iterations in 156 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 86/86 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:23:44] [INFO ] Invariant cache hit.
[2024-05-22 14:23:44] [INFO ] Implicit Places using invariants in 68 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 83
Applied a total of 2 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 84 cols
[2024-05-22 14:23:44] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 14:23:44] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 14:23:44] [INFO ] Invariant cache hit.
[2024-05-22 14:23:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:23:45] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 83/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 273 ms. Remains : 84/86 places, 83/84 transitions.
[2024-05-22 14:23:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144739 resets) in 585 ms. (1706 steps per ms)
BEST_FIRST walk for 1000000 steps (91457 resets) in 425 ms. (2347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 14:23:46] [INFO ] Invariant cache hit.
[2024-05-22 14:23:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 14:23:46] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:23:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:23:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:23:46] [INFO ] [Real]Added 14 Read/Feed constraints in 4 ms returned sat
[2024-05-22 14:23:46] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 5 ms.
[2024-05-22 14:23:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:23:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 14:23:46] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:23:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:23:46] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2024-05-22 14:23:46] [INFO ] Computed and/alt/rep : 79/458/79 causal constraints (skipped 3 transitions) in 4 ms.
[2024-05-22 14:23:46] [INFO ] Added : 57 causal constraints over 12 iterations in 124 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 14:23:46] [INFO ] Invariant cache hit.
[2024-05-22 14:23:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 14:23:46] [INFO ] Invariant cache hit.
[2024-05-22 14:23:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:23:46] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-22 14:23:46] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 14:23:46] [INFO ] Invariant cache hit.
[2024-05-22 14:23:46] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:23:47] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-22 14:23:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:23:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/197 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:23:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-22 14:23:49] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 14:23:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:23:50] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-22 14:23:50] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:23:51] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:23:51] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-22 14:23:51] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/167 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 205 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints]
After SMT, in 6919ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 6921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7219 ms. Remains : 84/84 places, 83/83 transitions.
[2024-05-22 14:23:53] [INFO ] Flatten gal took : 14 ms
[2024-05-22 14:23:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:23:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14738155659037278338.gal : 1 ms
[2024-05-22 14:23:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4093523215168140675.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14738155659037278338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4093523215168140675.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4093523215168140675.prop.
RANDOM walk for 40000 steps (5794 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
BEST_FIRST walk for 40001 steps (3597 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 91
BEST_FIRST walk for 40001 steps (3703 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :91 after 275
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :275 after 806
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :806 after 4799
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4799 after 37342
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :37342 after 193265
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :193265 after 550631
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :748076 after 8.46494e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :8.46494e+06 after 3.61369e+08
Interrupted probabilistic random walk after 566009 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 566009 steps, saw 283069 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-22 14:23:56] [INFO ] Invariant cache hit.
[2024-05-22 14:23:56] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:23:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:23:56] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-22 14:23:57] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2024-05-22 14:23:57] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-22 14:23:57] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:23:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:23:58] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1868ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 180 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
RANDOM walk for 40000 steps (5776 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3693 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.61369e+08 after 2.10899e+09
Interrupted probabilistic random walk after 307467 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 307467 steps, saw 153769 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-22 14:24:01] [INFO ] Invariant cache hit.
[2024-05-22 14:24:01] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:24:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:24:02] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-22 14:24:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-22 14:24:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:24:02] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 83/163 variables, 80/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/167 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 117 constraints, problems are : Problem set: 0 solved, 2 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/74 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:24:04] [INFO ] Deduced a trap composed of 3 places in 1796 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/80 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:24:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 83/163 variables, 80/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/167 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1983 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 193 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 14:24:04] [INFO ] Invariant cache hit.
[2024-05-22 14:24:09] [INFO ] Implicit Places using invariants in 4981 ms returned []
[2024-05-22 14:24:09] [INFO ] Invariant cache hit.
[2024-05-22 14:24:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 5157 ms to find 0 implicit places.
[2024-05-22 14:24:09] [INFO ] Redundant transitions in 11 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 14:24:09] [INFO ] Invariant cache hit.
[2024-05-22 14:24:09] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:24:11] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-22 14:24:11] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 14:24:11] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2985 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 2/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/167 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 82/197 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:24:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 14:24:13] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-22 14:24:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:24:14] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-22 14:24:14] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 14:24:15] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:24:15] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 14:24:15] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/167 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 205 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5290 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 11/11 constraints]
After SMT, in 8298ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 8299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13512 ms. Remains : 84/84 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 73 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 71
Applied a total of 24 rules in 12 ms. Remains 72 /84 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 72 cols
[2024-05-22 14:24:18] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 14:24:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:18] [INFO ] [Real]Absence check using 7 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:18] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 14:24:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 14:24:18] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 14:24:18] [INFO ] After 70ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2024-05-22 14:24:18] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2024-05-22 14:24:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:24:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:24:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4761062950251304259.gal : 1 ms
[2024-05-22 14:24:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6057429384052784703.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4761062950251304259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6057429384052784703.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6057429384052784703.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 87
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :87 after 162
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :162 after 306
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :306 after 632
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :632 after 1411
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1411 after 3167
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3167 after 6566
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6566 after 13454
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13454 after 27230
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :27230 after 54782
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :54782 after 109861
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.10899e+09 after 6.41467e+09
Detected timeout of ITS tools.
[2024-05-22 14:24:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:24:33] [INFO ] Applying decomposition
[2024-05-22 14:24:33] [INFO ] Flatten gal took : 14 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/graph2859106459270334558.txt' '-o' '/tmp/graph2859106459270334558.bin' '-w' '/tmp/graph2859106459270334558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2859106459270334558.bin' '-l' '-1' '-v' '-w' '/tmp/graph2859106459270334558.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:24:33] [INFO ] Decomposing Gal with order
[2024-05-22 14:24:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:24:33] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 14:24:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 14:24:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-22 14:24:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13931527606363432989.gal : 2 ms
[2024-05-22 14:24:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6653490825260681045.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13931527606363432989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6653490825260681045.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6653490825260681045.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :136 after 139
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :54665 after 55430
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :55430 after 55519
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :55519 after 55832
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106833 after 108654
Detected timeout of ITS tools.
[2024-05-22 14:24:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:24:43] [INFO ] Applying decomposition
[2024-05-22 14:24:43] [INFO ] Flatten gal took : 4 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/graph12312274074659064239.txt' '-o' '/tmp/graph12312274074659064239.bin' '-w' '/tmp/graph12312274074659064239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12312274074659064239.bin' '-l' '-1' '-v' '-w' '/tmp/graph12312274074659064239.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:24:43] [INFO ] Decomposing Gal with order
[2024-05-22 14:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:24:43] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-22 14:24:43] [INFO ] Flatten gal took : 15 ms
[2024-05-22 14:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 1 ms.
[2024-05-22 14:24:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15330805173382559781.gal : 5 ms
[2024-05-22 14:24:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6841398927929506883.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15330805173382559781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6841398927929506883.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6841398927929506883.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :252 after 255
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1142 after 1655
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1655 after 3239
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :45020 after 45838
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :88917 after 89451
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :579680 after 596304
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :132866 after 133883
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30458 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-05 in 65950 ms.
Starting property specific reduction for DoubleExponent-PT-004-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 95 rows 99 cols
[2024-05-22 14:24:48] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1436 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (909 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:24:48] [INFO ] Invariant cache hit.
[2024-05-22 14:24:48] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 14:24:48] [INFO ] [Real]Absence check using 6 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-22 14:24:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:24:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 14:24:48] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2024-05-22 14:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:48] [INFO ] [Nat]Absence check using 6 positive and 10 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:48] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:24:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 15 ms returned sat
[2024-05-22 14:24:48] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-22 14:24:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 14:24:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-22 14:24:48] [INFO ] Computed and/alt/rep : 94/439/94 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 14:24:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 14:24:49] [INFO ] Added : 61 causal constraints over 13 iterations in 193 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 95/95 transitions.
Graph (complete) has 333 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 96 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 96 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 95 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 90 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 90 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 87 transition count 84
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 25 place count 87 transition count 84
Applied a total of 25 rules in 6 ms. Remains 87 /99 variables (removed 12) and now considering 84/95 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/99 places, 84/95 transitions.
Found an invariant !
This invariant on transitions {11=1, 12=1, 21=1, 32=1, 38=1, 56=1, 59=1, 63=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {11=1, 12=1, 21=1, 32=1, 38=1, 56=1, 59=1, 63=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 84 rows 87 cols
[2024-05-22 14:24:51] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (143920 resets) in 589 ms. (1694 steps per ms)
BEST_FIRST walk for 1000000 steps (91379 resets) in 426 ms. (2341 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:24:52] [INFO ] Invariant cache hit.
[2024-05-22 14:24:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:52] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-22 14:24:52] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-22 14:24:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:52] [INFO ] [Real]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:52] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:52] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 14:24:52] [INFO ] [Nat]Added 14 Read/Feed constraints in 16 ms returned sat
[2024-05-22 14:24:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 14:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-22 14:24:52] [INFO ] Computed and/alt/rep : 80/447/80 causal constraints (skipped 3 transitions) in 6 ms.
[2024-05-22 14:24:53] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:24:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-22 14:24:53] [INFO ] Added : 61 causal constraints over 13 iterations in 292 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 87/87 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 14:24:53] [INFO ] Invariant cache hit.
[2024-05-22 14:24:53] [INFO ] Implicit Places using invariants in 63 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/87 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 83
Applied a total of 2 rules in 3 ms. Remains 85 /86 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 85 cols
[2024-05-22 14:24:53] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 14:24:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 14:24:53] [INFO ] Invariant cache hit.
[2024-05-22 14:24:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:53] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/87 places, 83/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 81
Applied a total of 4 rules in 4 ms. Remains 82 /84 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 82 cols
[2024-05-22 14:24:53] [INFO ] Computed 13 invariants in 3 ms
[2024-05-22 14:24:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 14:24:53] [INFO ] Invariant cache hit.
[2024-05-22 14:24:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:53] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 82/87 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 507 ms. Remains : 82/87 places, 81/84 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:24:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144589 resets) in 602 ms. (1658 steps per ms)
BEST_FIRST walk for 1000000 steps (91202 resets) in 432 ms. (2309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:24:55] [INFO ] Invariant cache hit.
[2024-05-22 14:24:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:55] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 14:24:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:55] [INFO ] [Real]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:24:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:55] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-22 14:24:55] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2024-05-22 14:24:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 14:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-22 14:24:55] [INFO ] Computed and/alt/rep : 75/416/75 causal constraints (skipped 5 transitions) in 7 ms.
[2024-05-22 14:24:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-22 14:24:55] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 14:24:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-22 14:24:55] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 14:24:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2024-05-22 14:24:55] [INFO ] Added : 55 causal constraints over 12 iterations in 333 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-22 14:24:55] [INFO ] Invariant cache hit.
[2024-05-22 14:24:56] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 14:24:56] [INFO ] Invariant cache hit.
[2024-05-22 14:24:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 14:24:56] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-22 14:24:56] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 14:24:56] [INFO ] Invariant cache hit.
[2024-05-22 14:24:56] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 109 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 76/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:24:58] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:24:58] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 14:24:59] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-05-22 14:24:59] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-22 14:24:59] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-22 14:24:59] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:25:01] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 14:25:01] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:25:03] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/163 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 14:25:03] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-22 14:25:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 200 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8675 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints]
After SMT, in 10362ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 10363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10602 ms. Remains : 82/82 places, 81/81 transitions.
Found an invariant !
This invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1, 10=1, 18=1, 29=1, 35=1, 51=1, 54=1, 58=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 14:25:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 14:25:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:25:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13352738458490990125.gal : 1 ms
[2024-05-22 14:25:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10936852625254145670.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13352738458490990125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10936852625254145670.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (5722 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10936852625254145670.prop.
BEST_FIRST walk for 40001 steps (3614 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 42
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :42 after 91
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :91 after 286
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :286 after 810
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :810 after 4799
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4799 after 38466
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :38466 after 201416
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :201416 after 569467
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.96947e+07,1.22693,38276,2,34697,20,146386,6,0,408,111026,0
Total reachable state count : 59694704
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,28,1.22891,38276,2,322,20,146386,7,0,411,111026,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 1334457 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1334457 steps, saw 667232 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-004-UpperBounds-12 in 21500 ms.
[2024-05-22 14:25:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:25:10] [INFO ] Applying decomposition
[2024-05-22 14:25:10] [INFO ] Flatten gal took : 3 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/graph6907521415215893847.txt' '-o' '/tmp/graph6907521415215893847.bin' '-w' '/tmp/graph6907521415215893847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6907521415215893847.bin' '-l' '-1' '-v' '-w' '/tmp/graph6907521415215893847.weights' '-q' '0' '-e' '0.001'
[2024-05-22 14:25:10] [INFO ] Decomposing Gal with order
[2024-05-22 14:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 14:25:10] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 14:25:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 14:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 2 ms.
[2024-05-22 14:25:10] [INFO ] Time to serialize gal into /tmp/UpperBounds12581507081491164839.gal : 2 ms
[2024-05-22 14:25:10] [INFO ] Time to serialize properties into /tmp/UpperBounds241461321203768992.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12581507081491164839.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds241461321203768992.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds241461321203768992.prop.
Detected timeout of ITS tools.
[2024-05-22 14:47:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 14:47:43] [INFO ] Time to serialize gal into /tmp/UpperBounds15780956444421018045.gal : 1 ms
[2024-05-22 14:47:43] [INFO ] Time to serialize properties into /tmp/UpperBounds4232892812366292258.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15780956444421018045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4232892812366292258.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds4232892812366292258.prop.
Detected timeout of ITS tools.
[2024-05-22 15:10:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 15:10:16] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-22 15:10:16] [INFO ] Transformed 99 places.
[2024-05-22 15:10:16] [INFO ] Transformed 95 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 15:10:16] [INFO ] Time to serialize gal into /tmp/UpperBounds17591700508176625772.gal : 2 ms
[2024-05-22 15:10:16] [INFO ] Time to serialize properties into /tmp/UpperBounds13809668633985521730.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17591700508176625772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13809668633985521730.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13809668633985521730.prop.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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-004"
export BK_EXAMINATION="UpperBounds"
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-004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132900549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;