About the Execution of LTSMin+red for ASLink-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2657.396 | 1614637.00 | 1862599.00 | 3160.70 | 1 1 ? 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.r464-smll-171620117800109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117800109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 677K 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 ASLink-PT-07a-UpperBounds-00
FORMULA_NAME ASLink-PT-07a-UpperBounds-01
FORMULA_NAME ASLink-PT-07a-UpperBounds-02
FORMULA_NAME ASLink-PT-07a-UpperBounds-03
FORMULA_NAME ASLink-PT-07a-UpperBounds-04
FORMULA_NAME ASLink-PT-07a-UpperBounds-05
FORMULA_NAME ASLink-PT-07a-UpperBounds-06
FORMULA_NAME ASLink-PT-07a-UpperBounds-07
FORMULA_NAME ASLink-PT-07a-UpperBounds-08
FORMULA_NAME ASLink-PT-07a-UpperBounds-09
FORMULA_NAME ASLink-PT-07a-UpperBounds-10
FORMULA_NAME ASLink-PT-07a-UpperBounds-11
FORMULA_NAME ASLink-PT-07a-UpperBounds-12
FORMULA_NAME ASLink-PT-07a-UpperBounds-13
FORMULA_NAME ASLink-PT-07a-UpperBounds-14
FORMULA_NAME ASLink-PT-07a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717213298113
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:41:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 03:41:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:41:40] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-06-01 03:41:40] [INFO ] Transformed 1601 places.
[2024-06-01 03:41:40] [INFO ] Transformed 2373 transitions.
[2024-06-01 03:41:40] [INFO ] Found NUPN structural information;
[2024-06-01 03:41:40] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2348 rows 1601 cols
[2024-06-01 03:41:41] [INFO ] Computed 308 invariants in 301 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (53 resets) in 183 ms. (54 steps per ms)
FORMULA ASLink-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (63 resets) in 327 ms. (335 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 03:41:41] [INFO ] Invariant cache hit.
[2024-06-01 03:41:42] [INFO ] [Real]Absence check using 75 positive place invariants in 64 ms returned sat
[2024-06-01 03:41:42] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 123 ms returned sat
[2024-06-01 03:41:44] [INFO ] [Real]Absence check using state equation in 1717 ms returned sat
[2024-06-01 03:41:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:41:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-06-01 03:41:45] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 99 ms returned sat
[2024-06-01 03:41:46] [INFO ] [Nat]Absence check using state equation in 1432 ms returned sat
[2024-06-01 03:41:47] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 289 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-06-01 03:41:50] [INFO ] [Real]Absence check using 75 positive place invariants in 55 ms returned sat
[2024-06-01 03:41:50] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 104 ms returned sat
[2024-06-01 03:41:51] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2024-06-01 03:41:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:41:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 60 ms returned sat
[2024-06-01 03:41:52] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 126 ms returned sat
[2024-06-01 03:41:54] [INFO ] [Nat]Absence check using state equation in 1881 ms returned sat
[2024-06-01 03:41:54] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 176 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 03:41:57] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-06-01 03:41:57] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 96 ms returned sat
[2024-06-01 03:41:58] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2024-06-01 03:41:58] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 188 ms.
[2024-06-01 03:41:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:41:59] [INFO ] [Nat]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-06-01 03:41:59] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 109 ms returned sat
[2024-06-01 03:42:00] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2024-06-01 03:42:01] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 175 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 03:42:04] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-06-01 03:42:04] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 103 ms returned sat
[2024-06-01 03:42:06] [INFO ] [Real]Absence check using state equation in 1678 ms returned sat
[2024-06-01 03:42:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:06] [INFO ] [Nat]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-06-01 03:42:06] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 103 ms returned sat
[2024-06-01 03:42:08] [INFO ] [Nat]Absence check using state equation in 1380 ms returned sat
[2024-06-01 03:42:08] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 30 ms to minimize.
[2024-06-01 03:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2024-06-01 03:42:09] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 267 ms.
[2024-06-01 03:42:09] [INFO ] Added : 5 causal constraints over 1 iterations in 1150 ms. Result :sat
Minimization took 632 ms.
[2024-06-01 03:42:11] [INFO ] [Real]Absence check using 75 positive place invariants in 55 ms returned sat
[2024-06-01 03:42:11] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 103 ms returned sat
[2024-06-01 03:42:12] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2024-06-01 03:42:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 56 ms returned sat
[2024-06-01 03:42:13] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 100 ms returned sat
[2024-06-01 03:42:14] [INFO ] [Nat]Absence check using state equation in 1740 ms returned sat
[2024-06-01 03:42:15] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 202 ms.
[2024-06-01 03:42:16] [INFO ] Added : 5 causal constraints over 1 iterations in 1338 ms. Result :unknown
[2024-06-01 03:42:16] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-06-01 03:42:16] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 104 ms returned sat
[2024-06-01 03:42:18] [INFO ] [Real]Absence check using state equation in 1392 ms returned sat
[2024-06-01 03:42:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:18] [INFO ] [Nat]Absence check using 75 positive place invariants in 56 ms returned sat
[2024-06-01 03:42:18] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 101 ms returned sat
[2024-06-01 03:42:20] [INFO ] [Nat]Absence check using state equation in 1623 ms returned sat
[2024-06-01 03:42:20] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-06-01 03:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-06-01 03:42:20] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 195 ms.
[2024-06-01 03:42:22] [INFO ] Added : 5 causal constraints over 1 iterations in 1356 ms. Result :unknown
[2024-06-01 03:42:22] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-06-01 03:42:22] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 105 ms returned sat
[2024-06-01 03:42:24] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2024-06-01 03:42:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:24] [INFO ] [Nat]Absence check using 75 positive place invariants in 55 ms returned sat
[2024-06-01 03:42:24] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 106 ms returned sat
[2024-06-01 03:42:25] [INFO ] [Nat]Absence check using state equation in 1304 ms returned sat
[2024-06-01 03:42:26] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 4 ms to minimize.
[2024-06-01 03:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2024-06-01 03:42:26] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 182 ms.
[2024-06-01 03:42:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 03:42:29] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-06-01 03:42:29] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 107 ms returned sat
[2024-06-01 03:42:31] [INFO ] [Real]Absence check using state equation in 1377 ms returned sat
[2024-06-01 03:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:31] [INFO ] [Nat]Absence check using 75 positive place invariants in 57 ms returned sat
[2024-06-01 03:42:31] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 106 ms returned sat
[2024-06-01 03:42:33] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2024-06-01 03:42:33] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 158 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 03:42:36] [INFO ] [Real]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-06-01 03:42:36] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 108 ms returned sat
[2024-06-01 03:42:38] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-06-01 03:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-06-01 03:42:38] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 105 ms returned sat
[2024-06-01 03:42:40] [INFO ] [Nat]Absence check using state equation in 1764 ms returned sat
[2024-06-01 03:42:40] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 169 ms.
[2024-06-01 03:42:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 03:42:43] [INFO ] [Real]Absence check using 75 positive place invariants in 53 ms returned sat
[2024-06-01 03:42:43] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 117 ms returned sat
[2024-06-01 03:42:45] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2024-06-01 03:42:45] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 202 ms.
[2024-06-01 03:42:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 57 ms returned sat
[2024-06-01 03:42:46] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 104 ms returned sat
[2024-06-01 03:42:48] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2024-06-01 03:42:48] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 181 ms.
[2024-06-01 03:42:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 03:42:51] [INFO ] [Real]Absence check using 75 positive place invariants in 52 ms returned sat
[2024-06-01 03:42:51] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 101 ms returned sat
[2024-06-01 03:42:53] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2024-06-01 03:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:42:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 64 ms returned sat
[2024-06-01 03:42:53] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 111 ms returned sat
[2024-06-01 03:42:55] [INFO ] [Nat]Absence check using state equation in 2005 ms returned sat
[2024-06-01 03:42:56] [INFO ] Deduced a trap composed of 27 places in 393 ms of which 9 ms to minimize.
[2024-06-01 03:42:56] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 8 ms to minimize.
[2024-06-01 03:42:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 929 ms
[2024-06-01 03:42:56] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 187 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-14 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1559 transition count 2207
Reduce places removed 141 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 325 place count 1418 transition count 2206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 1417 transition count 2206
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 326 place count 1417 transition count 2057
Deduced a syphon composed of 149 places in 5 ms
Ensure Unique test removed 57 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 355 rules applied. Total rules applied 681 place count 1211 transition count 2057
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 3 with 1 rules applied. Total rules applied 682 place count 1211 transition count 2056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 683 place count 1210 transition count 2056
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 693 place count 1200 transition count 2003
Ensure Unique test removed 1 places
Iterating global reduction 5 with 11 rules applied. Total rules applied 704 place count 1199 transition count 2003
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 710 place count 1198 transition count 1998
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 713 place count 1195 transition count 1998
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 714 place count 1194 transition count 1990
Iterating global reduction 7 with 1 rules applied. Total rules applied 715 place count 1194 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 716 place count 1193 transition count 1982
Iterating global reduction 7 with 1 rules applied. Total rules applied 717 place count 1193 transition count 1982
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 1192 transition count 1974
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 1192 transition count 1974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 720 place count 1191 transition count 1966
Iterating global reduction 7 with 1 rules applied. Total rules applied 721 place count 1191 transition count 1966
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 722 place count 1190 transition count 1958
Iterating global reduction 7 with 1 rules applied. Total rules applied 723 place count 1190 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 724 place count 1189 transition count 1950
Iterating global reduction 7 with 1 rules applied. Total rules applied 725 place count 1189 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 726 place count 1188 transition count 1942
Iterating global reduction 7 with 1 rules applied. Total rules applied 727 place count 1188 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 728 place count 1187 transition count 1934
Iterating global reduction 7 with 1 rules applied. Total rules applied 729 place count 1187 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 730 place count 1186 transition count 1926
Iterating global reduction 7 with 1 rules applied. Total rules applied 731 place count 1186 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 732 place count 1185 transition count 1918
Iterating global reduction 7 with 1 rules applied. Total rules applied 733 place count 1185 transition count 1918
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 734 place count 1184 transition count 1910
Iterating global reduction 7 with 1 rules applied. Total rules applied 735 place count 1184 transition count 1910
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 736 place count 1183 transition count 1902
Iterating global reduction 7 with 1 rules applied. Total rules applied 737 place count 1183 transition count 1902
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 738 place count 1182 transition count 1894
Iterating global reduction 7 with 1 rules applied. Total rules applied 739 place count 1182 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 740 place count 1181 transition count 1886
Iterating global reduction 7 with 1 rules applied. Total rules applied 741 place count 1181 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 742 place count 1180 transition count 1878
Iterating global reduction 7 with 1 rules applied. Total rules applied 743 place count 1180 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 744 place count 1179 transition count 1870
Iterating global reduction 7 with 1 rules applied. Total rules applied 745 place count 1179 transition count 1870
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 843 place count 1130 transition count 1821
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 850 place count 1130 transition count 1814
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 857 place count 1123 transition count 1814
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 865 place count 1123 transition count 1814
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 866 place count 1122 transition count 1813
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 879 place count 1109 transition count 1813
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 24 Pre rules applied. Total rules applied 879 place count 1109 transition count 1789
Deduced a syphon composed of 24 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 49 rules applied. Total rules applied 928 place count 1084 transition count 1789
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 9 with 8 rules applied. Total rules applied 936 place count 1076 transition count 1789
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 936 place count 1076 transition count 1788
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 938 place count 1075 transition count 1788
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 954 place count 1067 transition count 1780
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 961 place count 1060 transition count 1773
Iterating global reduction 10 with 7 rules applied. Total rules applied 968 place count 1060 transition count 1773
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 975 place count 1060 transition count 1766
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 982 place count 1053 transition count 1766
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 988 place count 1053 transition count 1766
Applied a total of 988 rules in 3263 ms. Remains 1053 /1601 variables (removed 548) and now considering 1766/2348 (removed 582) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3279 ms. Remains : 1053/1601 places, 1766/2348 transitions.
// Phase 1: matrix 1766 rows 1053 cols
[2024-06-01 03:43:02] [INFO ] Computed 185 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10564 resets) in 3823 ms. (261 steps per ms)
FORMULA ASLink-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000007 steps (13325 resets) in 14786 ms. (608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 03:43:21] [INFO ] Invariant cache hit.
[2024-06-01 03:43:21] [INFO ] [Real]Absence check using 47 positive place invariants in 31 ms returned sat
[2024-06-01 03:43:21] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 63 ms returned sat
[2024-06-01 03:43:22] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2024-06-01 03:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:43:22] [INFO ] [Nat]Absence check using 47 positive place invariants in 28 ms returned sat
[2024-06-01 03:43:22] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 59 ms returned sat
[2024-06-01 03:43:23] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2024-06-01 03:43:23] [INFO ] Deduced a trap composed of 107 places in 233 ms of which 4 ms to minimize.
[2024-06-01 03:43:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-06-01 03:43:24] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 138 ms.
[2024-06-01 03:43:38] [INFO ] Added : 563 causal constraints over 113 iterations in 14663 ms. Result :sat
Minimization took 1524 ms.
[2024-06-01 03:43:40] [INFO ] [Real]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:43:40] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 55 ms returned sat
[2024-06-01 03:43:41] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2024-06-01 03:43:41] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 153 ms.
[2024-06-01 03:43:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:43:42] [INFO ] [Nat]Absence check using 47 positive place invariants in 25 ms returned sat
[2024-06-01 03:43:42] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 63 ms returned sat
[2024-06-01 03:43:42] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2024-06-01 03:43:43] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 135 ms.
[2024-06-01 03:43:49] [INFO ] Added : 215 causal constraints over 43 iterations in 6364 ms. Result :sat
Minimization took 1502 ms.
[2024-06-01 03:43:51] [INFO ] [Real]Absence check using 47 positive place invariants in 22 ms returned sat
[2024-06-01 03:43:51] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:43:52] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-06-01 03:43:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:43:52] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:43:52] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:43:53] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-06-01 03:43:53] [INFO ] Deduced a trap composed of 92 places in 226 ms of which 13 ms to minimize.
[2024-06-01 03:43:53] [INFO ] Deduced a trap composed of 80 places in 232 ms of which 4 ms to minimize.
[2024-06-01 03:43:53] [INFO ] Deduced a trap composed of 94 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:43:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 946 ms
[2024-06-01 03:43:54] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 175 ms.
[2024-06-01 03:44:06] [INFO ] Added : 488 causal constraints over 98 iterations in 12507 ms. Result :sat
Minimization took 1495 ms.
[2024-06-01 03:44:08] [INFO ] [Real]Absence check using 47 positive place invariants in 23 ms returned sat
[2024-06-01 03:44:08] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:44:09] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-06-01 03:44:09] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:44:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:44:09] [INFO ] [Nat]Absence check using 47 positive place invariants in 26 ms returned sat
[2024-06-01 03:44:09] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:44:10] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-06-01 03:44:11] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 361 ms.
[2024-06-01 03:44:24] [INFO ] Added : 544 causal constraints over 109 iterations in 13916 ms. Result :sat
Minimization took 1480 ms.
[2024-06-01 03:44:26] [INFO ] [Real]Absence check using 47 positive place invariants in 23 ms returned sat
[2024-06-01 03:44:26] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:44:27] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2024-06-01 03:44:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:44:27] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:44:27] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:44:28] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2024-06-01 03:44:28] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 143 ms.
[2024-06-01 03:44:42] [INFO ] Added : 537 causal constraints over 108 iterations in 13624 ms. Result :sat
Minimization took 1543 ms.
[2024-06-01 03:44:43] [INFO ] [Real]Absence check using 47 positive place invariants in 23 ms returned sat
[2024-06-01 03:44:43] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:44:44] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-06-01 03:44:44] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 135 ms.
[2024-06-01 03:44:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:44:45] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:44:45] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:44:46] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2024-06-01 03:44:46] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 286 ms.
[2024-06-01 03:45:01] [INFO ] Added : 543 causal constraints over 109 iterations in 15409 ms. Result :sat
Minimization took 1650 ms.
[2024-06-01 03:45:03] [INFO ] [Real]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:45:03] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:45:04] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-06-01 03:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:45:04] [INFO ] [Nat]Absence check using 47 positive place invariants in 24 ms returned sat
[2024-06-01 03:45:04] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:45:05] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2024-06-01 03:45:06] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:45:11] [INFO ] Added : 193 causal constraints over 39 iterations in 5591 ms. Result :sat
Minimization took 1429 ms.
[2024-06-01 03:45:13] [INFO ] [Real]Absence check using 47 positive place invariants in 25 ms returned sat
[2024-06-01 03:45:13] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:45:14] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2024-06-01 03:45:14] [INFO ] Deduced a trap composed of 198 places in 578 ms of which 8 ms to minimize.
[2024-06-01 03:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:45:15] [INFO ] [Nat]Absence check using 47 positive place invariants in 23 ms returned sat
[2024-06-01 03:45:15] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:45:16] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2024-06-01 03:45:16] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 129 ms.
[2024-06-01 03:45:29] [INFO ] Added : 516 causal constraints over 104 iterations in 12960 ms. Result :sat
Minimization took 1786 ms.
[2024-06-01 03:45:31] [INFO ] [Real]Absence check using 47 positive place invariants in 23 ms returned sat
[2024-06-01 03:45:31] [INFO ] [Real]Absence check using 47 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:45:32] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2024-06-01 03:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:45:32] [INFO ] [Nat]Absence check using 47 positive place invariants in 22 ms returned sat
[2024-06-01 03:45:32] [INFO ] [Nat]Absence check using 47 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:45:33] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2024-06-01 03:45:33] [INFO ] Computed and/alt/rep : 702/2643/702 causal constraints (skipped 1027 transitions) in 130 ms.
[2024-06-01 03:45:44] [INFO ] Added : 484 causal constraints over 97 iterations in 11638 ms. Result :sat
Minimization took 1304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1053/1053 places, 1766/1766 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1053 transition count 1765
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1051 transition count 1765
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 1051 transition count 1762
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 1048 transition count 1762
Applied a total of 9 rules in 64 ms. Remains 1048 /1053 variables (removed 5) and now considering 1762/1766 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1048/1053 places, 1762/1766 transitions.
// Phase 1: matrix 1762 rows 1048 cols
[2024-06-01 03:45:56] [INFO ] Computed 184 invariants in 68 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10822 resets) in 4022 ms. (248 steps per ms)
BEST_FIRST walk for 9000007 steps (13804 resets) in 14113 ms. (637 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 03:46:14] [INFO ] Invariant cache hit.
[2024-06-01 03:46:14] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:46:14] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:46:15] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2024-06-01 03:46:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:46:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:46:15] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:46:16] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-06-01 03:46:16] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 124 ms.
[2024-06-01 03:46:29] [INFO ] Added : 481 causal constraints over 97 iterations in 13114 ms. Result :sat
Minimization took 1429 ms.
[2024-06-01 03:46:31] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:46:31] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:46:32] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-06-01 03:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:46:32] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:46:32] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:46:33] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-06-01 03:46:33] [INFO ] Deduced a trap composed of 123 places in 245 ms of which 3 ms to minimize.
[2024-06-01 03:46:33] [INFO ] Deduced a trap composed of 125 places in 242 ms of which 4 ms to minimize.
[2024-06-01 03:46:34] [INFO ] Deduced a trap composed of 104 places in 254 ms of which 4 ms to minimize.
[2024-06-01 03:46:34] [INFO ] Deduced a trap composed of 96 places in 269 ms of which 3 ms to minimize.
[2024-06-01 03:46:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1347 ms
[2024-06-01 03:46:34] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 124 ms.
[2024-06-01 03:46:38] [INFO ] Added : 141 causal constraints over 30 iterations in 4176 ms. Result :sat
Minimization took 1191 ms.
[2024-06-01 03:46:40] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:46:40] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 56 ms returned sat
[2024-06-01 03:46:41] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2024-06-01 03:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:46:41] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:46:41] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:46:42] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-06-01 03:46:42] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 127 ms.
[2024-06-01 03:46:51] [INFO ] Added : 395 causal constraints over 79 iterations in 8978 ms. Result :sat
Minimization took 1047 ms.
[2024-06-01 03:46:52] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:46:52] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:46:53] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2024-06-01 03:46:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:46:53] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:46:53] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:46:54] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2024-06-01 03:46:54] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 131 ms.
[2024-06-01 03:47:07] [INFO ] Added : 502 causal constraints over 101 iterations in 12626 ms. Result :sat
Minimization took 1212 ms.
[2024-06-01 03:47:08] [INFO ] [Real]Absence check using 46 positive place invariants in 44 ms returned sat
[2024-06-01 03:47:08] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 56 ms returned sat
[2024-06-01 03:47:09] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-06-01 03:47:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:47:09] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:47:09] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 54 ms returned sat
[2024-06-01 03:47:10] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2024-06-01 03:47:10] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:47:13] [INFO ] Added : 74 causal constraints over 15 iterations in 2654 ms. Result :sat
Minimization took 1062 ms.
[2024-06-01 03:47:14] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:47:14] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:47:15] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2024-06-01 03:47:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:47:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:47:16] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:47:17] [INFO ] [Nat]Absence check using state equation in 1057 ms returned sat
[2024-06-01 03:47:17] [INFO ] Deduced a trap composed of 105 places in 234 ms of which 3 ms to minimize.
[2024-06-01 03:47:17] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:47:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 639 ms
[2024-06-01 03:47:17] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 126 ms.
[2024-06-01 03:47:31] [INFO ] Added : 503 causal constraints over 101 iterations in 13714 ms. Result :sat
Minimization took 1311 ms.
[2024-06-01 03:47:33] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:47:33] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-06-01 03:47:33] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2024-06-01 03:47:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:47:34] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-06-01 03:47:34] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 49 ms returned sat
[2024-06-01 03:47:35] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2024-06-01 03:47:35] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 126 ms.
[2024-06-01 03:47:47] [INFO ] Added : 489 causal constraints over 98 iterations in 12542 ms. Result :sat
Minimization took 1236 ms.
[2024-06-01 03:47:49] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:47:49] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:47:50] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2024-06-01 03:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:47:50] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:47:50] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:47:51] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2024-06-01 03:47:51] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 122 ms.
[2024-06-01 03:48:03] [INFO ] Added : 490 causal constraints over 98 iterations in 12192 ms. Result :sat
Minimization took 1236 ms.
[2024-06-01 03:48:05] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-06-01 03:48:05] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 55 ms returned sat
[2024-06-01 03:48:06] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-06-01 03:48:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:48:06] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:48:06] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:48:07] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2024-06-01 03:48:07] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:48:19] [INFO ] Added : 518 causal constraints over 104 iterations in 12335 ms. Result :sat
Minimization took 1236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 39 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1048/1048 places, 1762/1762 transitions.
[2024-06-01 03:48:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10927 resets) in 3550 ms. (281 steps per ms)
BEST_FIRST walk for 7000007 steps (10730 resets) in 10972 ms. (637 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-01 03:48:44] [INFO ] Invariant cache hit.
[2024-06-01 03:48:44] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:48:44] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 56 ms returned sat
[2024-06-01 03:48:45] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2024-06-01 03:48:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:48:45] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:48:45] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:48:46] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2024-06-01 03:48:46] [INFO ] Deduced a trap composed of 123 places in 243 ms of which 4 ms to minimize.
[2024-06-01 03:48:46] [INFO ] Deduced a trap composed of 125 places in 254 ms of which 4 ms to minimize.
[2024-06-01 03:48:47] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 4 ms to minimize.
[2024-06-01 03:48:47] [INFO ] Deduced a trap composed of 96 places in 248 ms of which 4 ms to minimize.
[2024-06-01 03:48:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1295 ms
[2024-06-01 03:48:47] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 126 ms.
[2024-06-01 03:48:51] [INFO ] Added : 141 causal constraints over 30 iterations in 4116 ms. Result :sat
Minimization took 1188 ms.
[2024-06-01 03:48:53] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:48:53] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:48:54] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2024-06-01 03:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:48:54] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:48:54] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:48:55] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2024-06-01 03:48:55] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 133 ms.
[2024-06-01 03:49:04] [INFO ] Added : 395 causal constraints over 79 iterations in 8835 ms. Result :sat
Minimization took 1052 ms.
[2024-06-01 03:49:05] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:49:05] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:49:06] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2024-06-01 03:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:06] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:49:06] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:49:07] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-06-01 03:49:07] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 128 ms.
[2024-06-01 03:49:10] [INFO ] Added : 74 causal constraints over 15 iterations in 2641 ms. Result :sat
Minimization took 1054 ms.
[2024-06-01 03:49:11] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:49:11] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:49:12] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2024-06-01 03:49:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:12] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:49:12] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:49:13] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2024-06-01 03:49:14] [INFO ] Deduced a trap composed of 105 places in 226 ms of which 3 ms to minimize.
[2024-06-01 03:49:14] [INFO ] Deduced a trap composed of 106 places in 207 ms of which 4 ms to minimize.
[2024-06-01 03:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2024-06-01 03:49:14] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:49:28] [INFO ] Added : 503 causal constraints over 101 iterations in 13617 ms. Result :sat
Minimization took 1305 ms.
[2024-06-01 03:49:29] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:49:29] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:49:30] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2024-06-01 03:49:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:30] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:49:30] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:49:31] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2024-06-01 03:49:31] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:49:44] [INFO ] Added : 489 causal constraints over 98 iterations in 12598 ms. Result :sat
Minimization took 1250 ms.
[2024-06-01 03:49:45] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:49:46] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 54 ms returned sat
[2024-06-01 03:49:46] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2024-06-01 03:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:49:47] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:49:47] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:49:47] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2024-06-01 03:49:48] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 141 ms.
[2024-06-01 03:50:00] [INFO ] Added : 490 causal constraints over 98 iterations in 12287 ms. Result :sat
Minimization took 1225 ms.
[2024-06-01 03:50:01] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:50:01] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:50:02] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2024-06-01 03:50:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:50:02] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:50:03] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 50 ms returned sat
[2024-06-01 03:50:03] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-06-01 03:50:03] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 126 ms.
[2024-06-01 03:50:16] [INFO ] Added : 518 causal constraints over 104 iterations in 12358 ms. Result :sat
Minimization took 1230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 48 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1048/1048 places, 1762/1762 transitions.
[2024-06-01 03:50:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10848 resets) in 3506 ms. (285 steps per ms)
BEST_FIRST walk for 6000005 steps (9248 resets) in 9285 ms. (646 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 03:50:37] [INFO ] Invariant cache hit.
[2024-06-01 03:50:38] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:50:38] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 54 ms returned sat
[2024-06-01 03:50:38] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2024-06-01 03:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:50:39] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:50:39] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:50:40] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2024-06-01 03:50:40] [INFO ] Deduced a trap composed of 123 places in 271 ms of which 4 ms to minimize.
[2024-06-01 03:50:40] [INFO ] Deduced a trap composed of 125 places in 240 ms of which 3 ms to minimize.
[2024-06-01 03:50:40] [INFO ] Deduced a trap composed of 104 places in 263 ms of which 4 ms to minimize.
[2024-06-01 03:50:41] [INFO ] Deduced a trap composed of 96 places in 273 ms of which 4 ms to minimize.
[2024-06-01 03:50:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1366 ms
[2024-06-01 03:50:41] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 123 ms.
[2024-06-01 03:50:45] [INFO ] Added : 141 causal constraints over 30 iterations in 4089 ms. Result :sat
Minimization took 1190 ms.
[2024-06-01 03:50:46] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:50:47] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:50:47] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-06-01 03:50:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:50:48] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:50:48] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:50:48] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2024-06-01 03:50:49] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 128 ms.
[2024-06-01 03:50:51] [INFO ] Added : 74 causal constraints over 15 iterations in 2655 ms. Result :sat
Minimization took 1060 ms.
[2024-06-01 03:50:53] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:50:53] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 52 ms returned sat
[2024-06-01 03:50:53] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2024-06-01 03:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:50:54] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:50:54] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 48 ms returned sat
[2024-06-01 03:50:55] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2024-06-01 03:50:55] [INFO ] Deduced a trap composed of 105 places in 198 ms of which 8 ms to minimize.
[2024-06-01 03:50:55] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 3 ms to minimize.
[2024-06-01 03:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2024-06-01 03:50:56] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 120 ms.
[2024-06-01 03:51:09] [INFO ] Added : 503 causal constraints over 101 iterations in 13617 ms. Result :sat
Minimization took 1311 ms.
[2024-06-01 03:51:11] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-06-01 03:51:11] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:51:12] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2024-06-01 03:51:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:51:12] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-06-01 03:51:12] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 62 ms returned sat
[2024-06-01 03:51:13] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2024-06-01 03:51:13] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:51:25] [INFO ] Added : 489 causal constraints over 98 iterations in 12631 ms. Result :sat
Minimization took 1245 ms.
[2024-06-01 03:51:27] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:51:27] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:51:28] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2024-06-01 03:51:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:51:28] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:51:28] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:51:29] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2024-06-01 03:51:29] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 125 ms.
[2024-06-01 03:51:41] [INFO ] Added : 490 causal constraints over 98 iterations in 12272 ms. Result :sat
Minimization took 1226 ms.
[2024-06-01 03:51:43] [INFO ] [Real]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:51:43] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 53 ms returned sat
[2024-06-01 03:51:44] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2024-06-01 03:51:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:51:44] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2024-06-01 03:51:44] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 51 ms returned sat
[2024-06-01 03:51:45] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2024-06-01 03:51:45] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 127 ms.
[2024-06-01 03:51:57] [INFO ] Added : 518 causal constraints over 104 iterations in 12324 ms. Result :sat
Minimization took 1222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 37 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1048/1048 places, 1762/1762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1762/1762 transitions.
Applied a total of 0 rules in 37 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-06-01 03:52:06] [INFO ] Invariant cache hit.
[2024-06-01 03:52:07] [INFO ] Implicit Places using invariants in 1349 ms returned [0, 18, 19, 30, 48, 66, 136, 140, 149, 150, 151, 169, 187, 224, 260, 264, 265, 276, 277, 278, 296, 314, 383, 387, 388, 399, 400, 401, 419, 437, 506, 510, 511, 522, 523, 524, 542, 560, 629, 633, 634, 645, 646, 647, 665, 683, 752, 756, 757, 768, 769, 770, 788, 806, 875, 879, 880, 883, 894, 895, 896, 914, 916, 919, 937, 938, 939, 940, 952, 958, 964, 970, 976, 982, 988, 994, 1000, 1006, 1012]
[2024-06-01 03:52:07] [INFO ] Actually due to overlaps returned [914, 896, 48, 151, 169, 278, 296, 401, 419, 524, 542, 647, 665, 770, 788, 919, 30, 150, 277, 400, 523, 646, 769, 895, 938, 149, 276, 399, 522, 645, 768, 894, 916, 937, 0, 264, 265, 387, 388, 510, 511, 633, 634, 756, 757, 879, 880, 18, 19, 66, 187, 314, 437, 560, 683, 806, 940, 982, 1000, 1012, 883, 939, 952, 958, 964, 970, 976, 988, 994, 1006]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1357 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 978/1048 places, 1762/1762 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 971 transition count 1631
Reduce places removed 131 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 133 rules applied. Total rules applied 271 place count 840 transition count 1629
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 273 place count 838 transition count 1629
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 273 place count 838 transition count 1595
Deduced a syphon composed of 34 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 342 place count 803 transition count 1595
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 354 place count 799 transition count 1587
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 362 place count 791 transition count 1587
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 377 place count 776 transition count 1572
Iterating global reduction 5 with 15 rules applied. Total rules applied 392 place count 776 transition count 1572
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 395 place count 776 transition count 1569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 395 place count 776 transition count 1568
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 397 place count 775 transition count 1568
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 400 place count 772 transition count 1565
Iterating global reduction 6 with 3 rules applied. Total rules applied 403 place count 772 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 404 place count 771 transition count 1564
Iterating global reduction 6 with 1 rules applied. Total rules applied 405 place count 771 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 406 place count 770 transition count 1563
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 770 transition count 1563
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 527 place count 710 transition count 1503
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 533 place count 710 transition count 1497
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 540 place count 703 transition count 1490
Iterating global reduction 7 with 7 rules applied. Total rules applied 547 place count 703 transition count 1490
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 554 place count 703 transition count 1483
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 570 place count 703 transition count 1467
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 587 place count 686 transition count 1467
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 588 place count 686 transition count 1466
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 610 place count 686 transition count 1466
Applied a total of 610 rules in 584 ms. Remains 686 /978 variables (removed 292) and now considering 1466/1762 (removed 296) transitions.
// Phase 1: matrix 1466 rows 686 cols
[2024-06-01 03:52:08] [INFO ] Computed 101 invariants in 17 ms
[2024-06-01 03:52:09] [INFO ] Implicit Places using invariants in 1241 ms returned [73, 91, 97, 100, 102, 103, 106, 107, 159, 171, 181, 187, 190, 192, 197, 198, 250, 267, 273, 276, 278, 283, 284, 336, 353, 359, 362, 364, 369, 370, 422, 439, 445, 448, 450, 455, 456, 508, 526, 532, 535, 537, 542, 543, 595, 612, 618, 621, 623]
[2024-06-01 03:52:09] [INFO ] Actually due to overlaps returned [106, 197, 283, 369, 455, 542, 107, 198, 284, 370, 456, 543, 91, 97, 102, 103, 181, 187, 192, 267, 273, 278, 353, 359, 364, 439, 445, 450, 526, 532, 537, 612, 618, 623, 73, 159, 171, 250, 336, 422, 508, 595]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1245 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 644/1048 places, 1466/1762 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 616 transition count 1438
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 616 transition count 1438
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 609 transition count 1431
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 609 transition count 1431
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 98 place count 595 transition count 1417
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 119 place count 595 transition count 1396
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 140 place count 574 transition count 1396
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 574 transition count 1390
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 152 place count 568 transition count 1390
Applied a total of 152 rules in 254 ms. Remains 568 /644 variables (removed 76) and now considering 1390/1466 (removed 76) transitions.
// Phase 1: matrix 1390 rows 568 cols
[2024-06-01 03:52:09] [INFO ] Computed 59 invariants in 15 ms
[2024-06-01 03:52:10] [INFO ] Implicit Places using invariants in 743 ms returned []
[2024-06-01 03:52:10] [INFO ] Invariant cache hit.
[2024-06-01 03:52:12] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 568/1048 places, 1390/1762 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5985 ms. Remains : 568/1048 places, 1390/1762 transitions.
[2024-06-01 03:52:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (17448 resets) in 2497 ms. (400 steps per ms)
BEST_FIRST walk for 6000004 steps (20436 resets) in 5511 ms. (1088 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-06-01 03:52:20] [INFO ] Invariant cache hit.
[2024-06-01 03:52:20] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:20] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:20] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-06-01 03:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-06-01 03:52:21] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 21 ms returned sat
[2024-06-01 03:52:21] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-06-01 03:52:21] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 100 ms.
[2024-06-01 03:52:22] [INFO ] Added : 31 causal constraints over 8 iterations in 842 ms. Result :sat
Minimization took 910 ms.
[2024-06-01 03:52:23] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:23] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 22 ms returned sat
[2024-06-01 03:52:24] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2024-06-01 03:52:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:24] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 20 ms returned sat
[2024-06-01 03:52:24] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-06-01 03:52:24] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 98 ms.
[2024-06-01 03:52:25] [INFO ] Added : 19 causal constraints over 4 iterations in 521 ms. Result :sat
Minimization took 876 ms.
[2024-06-01 03:52:26] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:26] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 22 ms returned sat
[2024-06-01 03:52:27] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-06-01 03:52:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:27] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 21 ms returned sat
[2024-06-01 03:52:27] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2024-06-01 03:52:27] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 101 ms.
[2024-06-01 03:52:28] [INFO ] Added : 36 causal constraints over 8 iterations in 910 ms. Result :sat
Minimization took 895 ms.
[2024-06-01 03:52:29] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:29] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 21 ms returned sat
[2024-06-01 03:52:30] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2024-06-01 03:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:30] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 22 ms returned sat
[2024-06-01 03:52:31] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-06-01 03:52:31] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 94 ms.
[2024-06-01 03:52:32] [INFO ] Added : 38 causal constraints over 9 iterations in 875 ms. Result :sat
Minimization took 921 ms.
[2024-06-01 03:52:33] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:33] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:33] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-06-01 03:52:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:34] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:34] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-06-01 03:52:34] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 98 ms.
[2024-06-01 03:52:35] [INFO ] Added : 49 causal constraints over 10 iterations in 1025 ms. Result :sat
Minimization took 921 ms.
[2024-06-01 03:52:36] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:36] [INFO ] [Real]Absence check using 14 positive and 45 generalized place invariants in 21 ms returned sat
[2024-06-01 03:52:37] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-06-01 03:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:37] [INFO ] [Nat]Absence check using 14 positive and 45 generalized place invariants in 23 ms returned sat
[2024-06-01 03:52:37] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2024-06-01 03:52:38] [INFO ] Computed and/alt/rep : 319/1410/319 causal constraints (skipped 1037 transitions) in 101 ms.
[2024-06-01 03:52:38] [INFO ] Added : 31 causal constraints over 7 iterations in 807 ms. Result :sat
Minimization took 895 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 1390/1390 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 1389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 567 transition count 1388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 566 transition count 1388
Applied a total of 4 rules in 67 ms. Remains 566 /568 variables (removed 2) and now considering 1388/1390 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 566/568 places, 1388/1390 transitions.
// Phase 1: matrix 1388 rows 566 cols
[2024-06-01 03:52:41] [INFO ] Computed 59 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (17407 resets) in 2498 ms. (400 steps per ms)
BEST_FIRST walk for 5000003 steps (17050 resets) in 4593 ms. (1088 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 03:52:48] [INFO ] Invariant cache hit.
[2024-06-01 03:52:48] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:48] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 23 ms returned sat
[2024-06-01 03:52:49] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2024-06-01 03:52:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:49] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:52:49] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2024-06-01 03:52:50] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 96 ms.
[2024-06-01 03:52:50] [INFO ] Added : 23 causal constraints over 5 iterations in 540 ms. Result :sat
Minimization took 668 ms.
[2024-06-01 03:52:51] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:51] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 23 ms returned sat
[2024-06-01 03:52:51] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2024-06-01 03:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:52] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:52] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-06-01 03:52:53] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 5 ms to minimize.
[2024-06-01 03:52:53] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 4 ms to minimize.
[2024-06-01 03:52:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 680 ms
[2024-06-01 03:52:53] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 99 ms.
[2024-06-01 03:52:54] [INFO ] Added : 19 causal constraints over 4 iterations in 606 ms. Result :sat
Minimization took 680 ms.
[2024-06-01 03:52:55] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 03:52:55] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:55] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2024-06-01 03:52:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:55] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:52:56] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2024-06-01 03:52:56] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 103 ms.
[2024-06-01 03:52:57] [INFO ] Added : 31 causal constraints over 7 iterations in 859 ms. Result :sat
Minimization took 745 ms.
[2024-06-01 03:52:58] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:58] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-06-01 03:52:58] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-06-01 03:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:52:58] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 21 ms returned sat
[2024-06-01 03:52:59] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2024-06-01 03:52:59] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 96 ms.
[2024-06-01 03:53:00] [INFO ] Added : 51 causal constraints over 11 iterations in 1107 ms. Result :sat
Minimization took 725 ms.
[2024-06-01 03:53:01] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:53:01] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:53:02] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-06-01 03:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:53:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:53:02] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:53:02] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2024-06-01 03:53:02] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-06-01 03:53:04] [INFO ] Added : 70 causal constraints over 14 iterations in 1878 ms. Result :sat
Minimization took 811 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1388/1388 transitions.
Applied a total of 0 rules in 35 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 566/566 places, 1388/1388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1388/1388 transitions.
Applied a total of 0 rules in 22 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
[2024-06-01 03:53:07] [INFO ] Invariant cache hit.
[2024-06-01 03:53:08] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-06-01 03:53:08] [INFO ] Invariant cache hit.
[2024-06-01 03:53:09] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2543 ms to find 0 implicit places.
[2024-06-01 03:53:09] [INFO ] Redundant transitions in 149 ms returned []
Running 1354 sub problems to find dead transitions.
[2024-06-01 03:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1954 variables, and 55 constraints, problems are : Problem set: 0 solved, 1354 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 46/47 constraints, State Equation: 0/566 constraints, PredecessorRefiner: 1354/1354 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 3 (OVERLAPS) 1/566 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1954 variables, and 59 constraints, problems are : Problem set: 0 solved, 1354 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/566 constraints, PredecessorRefiner: 0/1354 constraints, Known Traps: 0/0 constraints]
After SMT, in 61355ms problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 61450ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64198 ms. Remains : 566/566 places, 1388/1388 transitions.
RANDOM walk for 40000 steps (711 resets) in 2580 ms. (15 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (138 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (134 resets) in 353 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (124 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (124 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (134 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (143 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (129 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (130 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (129 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (139 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 108801 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 10
Probabilistic random walk after 108801 steps, saw 65348 distinct states, run finished after 3006 ms. (steps per millisecond=36 ) properties seen :0
[2024-06-01 03:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 284/294 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/302 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 181/483 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 48/531 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 35/566 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1388/1954 variables, 566/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1954 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1954 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 625 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2685 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 284/294 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/302 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 181/483 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 48/531 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 35/566 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1388/1954 variables, 566/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1954 variables, 10/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1954 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1954 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 635 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2622 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 5324ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3898 ms.
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1388/1388 transitions.
Applied a total of 0 rules in 22 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 566/566 places, 1388/1388 transitions.
RANDOM walk for 40000 steps (712 resets) in 883 ms. (45 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (135 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (134 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (126 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (136 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (139 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (139 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (130 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (136 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 82951 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 10
Probabilistic random walk after 82951 steps, saw 50540 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-06-01 03:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 284/294 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/302 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 181/483 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 48/531 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 35/566 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1388/1954 variables, 566/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1954 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/1954 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1954/1954 variables, and 625 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 284/294 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 8/302 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 181/483 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 48/531 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 35/566 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1388/1954 variables, 566/625 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1954 variables, 10/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1954 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1954 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1954/1954 variables, and 635 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 566/566 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 5051ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4263 ms.
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1388/1388 transitions.
Applied a total of 0 rules in 22 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 566/566 places, 1388/1388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1388/1388 transitions.
Applied a total of 0 rules in 21 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
[2024-06-01 03:54:38] [INFO ] Invariant cache hit.
[2024-06-01 03:54:39] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-06-01 03:54:39] [INFO ] Invariant cache hit.
[2024-06-01 03:54:41] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
[2024-06-01 03:54:41] [INFO ] Redundant transitions in 66 ms returned []
Running 1354 sub problems to find dead transitions.
[2024-06-01 03:54:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1954 variables, and 55 constraints, problems are : Problem set: 0 solved, 1354 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 46/47 constraints, State Equation: 0/566 constraints, PredecessorRefiner: 1354/1354 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 3 (OVERLAPS) 1/566 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/1954 variables, and 59 constraints, problems are : Problem set: 0 solved, 1354 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/566 constraints, PredecessorRefiner: 0/1354 constraints, Known Traps: 0/0 constraints]
After SMT, in 60852ms problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 60869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63356 ms. Remains : 566/566 places, 1388/1388 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 34 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-06-01 03:55:42] [INFO ] Invariant cache hit.
[2024-06-01 03:55:42] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 03:55:42] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 33 ms returned sat
[2024-06-01 03:55:43] [INFO ] After 1469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 03:55:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 03:55:43] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 42 ms returned sat
[2024-06-01 03:55:44] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 03:55:45] [INFO ] After 1813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 03:55:46] [INFO ] After 2656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 4193 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for ASLink-PT-07a-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]
[2024-06-01 03:55:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (152 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 03:55:46] [INFO ] Invariant cache hit.
[2024-06-01 03:55:46] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:55:46] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:55:46] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-06-01 03:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:55:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:55:47] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:55:47] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-06-01 03:55:47] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 100 ms.
[2024-06-01 03:55:48] [INFO ] Added : 23 causal constraints over 5 iterations in 550 ms. Result :sat
Minimization took 502 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 566 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p885) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1387/1387 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3468 edges and 565 vertex of which 564 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 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 4 place count 564 transition count 1384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 562 transition count 1384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 562 transition count 1381
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 13 place count 558 transition count 1381
Applied a total of 13 rules in 54 ms. Remains 558 /566 variables (removed 8) and now considering 1381/1387 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 558/566 places, 1381/1387 transitions.
// Phase 1: matrix 1381 rows 558 cols
[2024-06-01 03:55:48] [INFO ] Computed 57 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17321 resets) in 2465 ms. (405 steps per ms)
BEST_FIRST walk for 1000001 steps (3407 resets) in 918 ms. (1088 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 03:55:52] [INFO ] Invariant cache hit.
[2024-06-01 03:55:52] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 03:55:52] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 20 ms returned sat
[2024-06-01 03:55:52] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-06-01 03:55:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:55:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 03:55:53] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 20 ms returned sat
[2024-06-01 03:55:53] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-06-01 03:55:53] [INFO ] Computed and/alt/rep : 303/1335/303 causal constraints (skipped 1044 transitions) in 161 ms.
[2024-06-01 03:55:54] [INFO ] Added : 35 causal constraints over 7 iterations in 808 ms. Result :sat
Minimization took 1015 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 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 23 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 558/558 places, 1381/1381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-06-01 03:55:55] [INFO ] Invariant cache hit.
[2024-06-01 03:55:56] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 03:55:56] [INFO ] Invariant cache hit.
[2024-06-01 03:55:58] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2024-06-01 03:55:58] [INFO ] Redundant transitions in 38 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-06-01 03:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1939 variables, and 47 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 1347/1347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 3 (OVERLAPS) 2/558 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1939 variables, and 57 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 0/1347 constraints, Known Traps: 0/0 constraints]
After SMT, in 60868ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63291 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (685 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (134 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 171973 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 171973 steps, saw 112256 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 03:57:02] [INFO ] Invariant cache hit.
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) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 209/274 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/312 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 183/495 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/500 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/500 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 57/557 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1938 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1939 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1939/1939 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 209/274 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/312 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 183/495 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/500 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/500 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 57/557 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1938 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1938 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1939 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1939 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1939 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1939/1939 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 325 ms.
Support contains 1 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 20 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (700 resets) in 350 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 211162 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 2
Probabilistic random walk after 211162 steps, saw 140711 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 03:57:08] [INFO ] Invariant cache hit.
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) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 209/274 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/312 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 183/495 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/500 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/500 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 57/557 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1938 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/1939 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1939/1939 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 209/274 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/312 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 183/495 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/495 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/500 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/500 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 57/557 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1938 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1938 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1939 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1939 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1939 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1939/1939 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2297ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 1 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 558/558 places, 1381/1381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-06-01 03:57:11] [INFO ] Invariant cache hit.
[2024-06-01 03:57:12] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-06-01 03:57:12] [INFO ] Invariant cache hit.
[2024-06-01 03:57:13] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
[2024-06-01 03:57:13] [INFO ] Redundant transitions in 24 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-06-01 03:57:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1939 variables, and 47 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 1347/1347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 3 (OVERLAPS) 2/558 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1939 variables, and 57 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 0/1347 constraints, Known Traps: 0/0 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63289 ms. Remains : 558/558 places, 1381/1381 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 03:58:14] [INFO ] Invariant cache hit.
[2024-06-01 03:58:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 03:58:14] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 26 ms returned sat
[2024-06-01 03:58:15] [INFO ] After 789ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 03:58:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 03:58:15] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 25 ms returned sat
[2024-06-01 03:58:16] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 03:58:16] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 03:58:16] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1828 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-07a-UpperBounds-02 in 150292 ms.
Starting property specific reduction for ASLink-PT-07a-UpperBounds-07
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 1388 rows 566 cols
[2024-06-01 03:58:16] [INFO ] Computed 59 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (147 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10000 steps (34 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 03:58:16] [INFO ] Invariant cache hit.
[2024-06-01 03:58:16] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 03:58:16] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 23 ms returned sat
[2024-06-01 03:58:17] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-06-01 03:58:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:58:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 03:58:17] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 03:58:18] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2024-06-01 03:58:18] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 4 ms to minimize.
[2024-06-01 03:58:18] [INFO ] Deduced a trap composed of 59 places in 285 ms of which 4 ms to minimize.
[2024-06-01 03:58:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2024-06-01 03:58:18] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 98 ms.
[2024-06-01 03:58:19] [INFO ] Added : 19 causal constraints over 4 iterations in 612 ms. Result :sat
Minimization took 505 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 566 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p307) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1387/1387 transitions.
Graph (complete) has 3471 edges and 566 vertex of which 564 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3466 edges and 563 vertex of which 562 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 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 562 transition count 1383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 560 transition count 1383
Applied a total of 7 rules in 28 ms. Remains 560 /566 variables (removed 6) and now considering 1383/1387 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 560/566 places, 1383/1387 transitions.
// Phase 1: matrix 1383 rows 560 cols
[2024-06-01 03:58:20] [INFO ] Computed 57 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17403 resets) in 2470 ms. (404 steps per ms)
BEST_FIRST walk for 1000001 steps (3417 resets) in 934 ms. (1069 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 03:58:23] [INFO ] Invariant cache hit.
[2024-06-01 03:58:23] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 03:58:23] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 21 ms returned sat
[2024-06-01 03:58:24] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2024-06-01 03:58:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:58:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 03:58:24] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 25 ms returned sat
[2024-06-01 03:58:24] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2024-06-01 03:58:25] [INFO ] Computed and/alt/rep : 305/1345/305 causal constraints (skipped 1044 transitions) in 101 ms.
[2024-06-01 03:58:25] [INFO ] Added : 22 causal constraints over 5 iterations in 625 ms. Result :sat
Minimization took 1695 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 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 560/560 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 03:58:27] [INFO ] Invariant cache hit.
[2024-06-01 03:58:28] [INFO ] Implicit Places using invariants in 797 ms returned []
[2024-06-01 03:58:28] [INFO ] Invariant cache hit.
[2024-06-01 03:58:30] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2024-06-01 03:58:30] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-06-01 03:58:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1943 variables, and 47 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1349/1349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 3 (OVERLAPS) 2/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1943 variables, and 57 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1349 constraints, Known Traps: 0/0 constraints]
After SMT, in 60972ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60988ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63524 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (682 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (137 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (145 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 205335 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205335 steps, saw 136426 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 03:59:34] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1943 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1943/1943 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1942 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1943 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1943/1943 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2399ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 484 ms.
Support contains 1 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 20 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (714 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (128 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187159 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187159 steps, saw 123307 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 03:59:40] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1943 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1943/1943 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1942 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1943 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1943/1943 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2347ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 1 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 560/560 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 20 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 03:59:43] [INFO ] Invariant cache hit.
[2024-06-01 03:59:43] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-06-01 03:59:43] [INFO ] Invariant cache hit.
[2024-06-01 03:59:45] [INFO ] Implicit Places using invariants and state equation in 1749 ms returned []
Implicit Place search using SMT with State Equation took 2453 ms to find 0 implicit places.
[2024-06-01 03:59:45] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-06-01 03:59:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1943 variables, and 47 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1349/1349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 3 (OVERLAPS) 2/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 1)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1943 variables, and 57 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1349 constraints, Known Traps: 0/0 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63300 ms. Remains : 560/560 places, 1383/1383 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 27 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 04:00:46] [INFO ] Invariant cache hit.
[2024-06-01 04:00:46] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 04:00:46] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 27 ms returned sat
[2024-06-01 04:00:47] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 04:00:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 04:00:47] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 26 ms returned sat
[2024-06-01 04:00:48] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 04:00:48] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-06-01 04:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
TRAPS : Iteration 1
[2024-06-01 04:00:48] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 04:00:48] [INFO ] After 1333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2206 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-07a-UpperBounds-07 in 152254 ms.
Starting property specific reduction for ASLink-PT-07a-UpperBounds-11
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 1388 rows 566 cols
[2024-06-01 04:00:48] [INFO ] Computed 59 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (149 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (35 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:00:48] [INFO ] Invariant cache hit.
[2024-06-01 04:00:49] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 04:00:49] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 04:00:49] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2024-06-01 04:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:00:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 04:00:49] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-06-01 04:00:50] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2024-06-01 04:00:50] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 101 ms.
[2024-06-01 04:00:51] [INFO ] Added : 31 causal constraints over 7 iterations in 860 ms. Result :sat
Minimization took 503 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 566 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p313) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1387/1387 transitions.
Graph (complete) has 3471 edges and 566 vertex of which 564 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3466 edges and 563 vertex of which 562 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 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 562 transition count 1383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 560 transition count 1383
Applied a total of 7 rules in 27 ms. Remains 560 /566 variables (removed 6) and now considering 1383/1387 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 560/566 places, 1383/1387 transitions.
// Phase 1: matrix 1383 rows 560 cols
[2024-06-01 04:00:51] [INFO ] Computed 57 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17373 resets) in 2381 ms. (419 steps per ms)
BEST_FIRST walk for 1000001 steps (3414 resets) in 903 ms. (1106 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:00:55] [INFO ] Invariant cache hit.
[2024-06-01 04:00:55] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-06-01 04:00:55] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 24 ms returned sat
[2024-06-01 04:00:55] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-06-01 04:00:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:00:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 04:00:56] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 20 ms returned sat
[2024-06-01 04:00:56] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-06-01 04:00:56] [INFO ] Computed and/alt/rep : 305/1345/305 causal constraints (skipped 1044 transitions) in 98 ms.
[2024-06-01 04:00:57] [INFO ] Added : 22 causal constraints over 5 iterations in 623 ms. Result :sat
Minimization took 1706 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 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 20 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 560/560 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 04:00:59] [INFO ] Invariant cache hit.
[2024-06-01 04:00:59] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-06-01 04:00:59] [INFO ] Invariant cache hit.
[2024-06-01 04:01:01] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
[2024-06-01 04:01:01] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-06-01 04:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1943 variables, and 47 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1349/1349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 3 (OVERLAPS) 2/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1943 variables, and 57 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1349 constraints, Known Traps: 0/0 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63161 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (691 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 221102 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221102 steps, saw 147918 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 04:02:05] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1943 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1943/1943 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1942 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1943 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1943/1943 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2398ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 263 ms.
Support contains 1 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 20 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (694 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (142 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 186768 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 186768 steps, saw 123015 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 04:02:11] [INFO ] Invariant cache hit.
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) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1943 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1943 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1943/1943 variables, and 617 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/54 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 168/222 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/373 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/377 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 99/476 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 34/510 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 49/559 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1383/1942 variables, 559/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1942 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1942 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1943 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1943 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1943/1943 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2348ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 605 ms.
Support contains 1 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 22 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 560/560 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1383/1383 transitions.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-06-01 04:02:14] [INFO ] Invariant cache hit.
[2024-06-01 04:02:15] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 04:02:15] [INFO ] Invariant cache hit.
[2024-06-01 04:02:16] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2024-06-01 04:02:16] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-06-01 04:02:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1943 variables, and 47 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 37/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1349/1349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 3 (OVERLAPS) 2/560 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 1349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/1943 variables, and 57 constraints, problems are : Problem set: 0 solved, 1349 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1349 constraints, Known Traps: 0/0 constraints]
After SMT, in 60823ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63318 ms. Remains : 560/560 places, 1383/1383 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 04:03:17] [INFO ] Invariant cache hit.
[2024-06-01 04:03:17] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-01 04:03:17] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 27 ms returned sat
[2024-06-01 04:03:18] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 04:03:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 04:03:18] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 26 ms returned sat
[2024-06-01 04:03:19] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 04:03:19] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
[2024-06-01 04:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
TRAPS : Iteration 1
[2024-06-01 04:03:19] [INFO ] After 1092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 04:03:20] [INFO ] After 1376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2250 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-07a-UpperBounds-11 in 151285 ms.
Starting property specific reduction for ASLink-PT-07a-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 1388 rows 566 cols
[2024-06-01 04:03:20] [INFO ] Computed 59 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (182 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:03:20] [INFO ] Invariant cache hit.
[2024-06-01 04:03:20] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 04:03:20] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 04:03:20] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2024-06-01 04:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:03:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 04:03:21] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 22 ms returned sat
[2024-06-01 04:03:21] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-06-01 04:03:21] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 99 ms.
[2024-06-01 04:03:22] [INFO ] Added : 51 causal constraints over 11 iterations in 1186 ms. Result :sat
Minimization took 504 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 566 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p30) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1387/1387 transitions.
Reduce places removed 1 places and 2 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 2 place count 565 transition count 1384
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 563 transition count 1383
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 562 transition count 1382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5 place count 562 transition count 1379
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 12 place count 558 transition count 1379
Applied a total of 12 rules in 34 ms. Remains 558 /566 variables (removed 8) and now considering 1379/1387 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 558/566 places, 1379/1387 transitions.
// Phase 1: matrix 1379 rows 558 cols
[2024-06-01 04:03:23] [INFO ] Computed 58 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17428 resets) in 2445 ms. (408 steps per ms)
BEST_FIRST walk for 1000001 steps (3409 resets) in 927 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:03:26] [INFO ] Invariant cache hit.
[2024-06-01 04:03:27] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-01 04:03:27] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 33 ms returned sat
[2024-06-01 04:03:27] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2024-06-01 04:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:03:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-01 04:03:27] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 21 ms returned sat
[2024-06-01 04:03:28] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-06-01 04:03:28] [INFO ] Computed and/alt/rep : 301/1332/301 causal constraints (skipped 1044 transitions) in 102 ms.
[2024-06-01 04:03:28] [INFO ] Added : 13 causal constraints over 3 iterations in 416 ms. Result :sat
Minimization took 629 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 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1379/1379 transitions.
Applied a total of 0 rules in 24 ms. Remains 558 /558 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 558/558 places, 1379/1379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1379/1379 transitions.
Applied a total of 0 rules in 20 ms. Remains 558 /558 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2024-06-01 04:03:29] [INFO ] Invariant cache hit.
[2024-06-01 04:03:30] [INFO ] Implicit Places using invariants in 706 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 718 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 557/558 places, 1379/1379 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 557 transition count 1372
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 550 transition count 1372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 548 transition count 1370
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 548 transition count 1368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 546 transition count 1368
Applied a total of 22 rules in 59 ms. Remains 546 /557 variables (removed 11) and now considering 1368/1379 (removed 11) transitions.
// Phase 1: matrix 1368 rows 546 cols
[2024-06-01 04:03:30] [INFO ] Computed 57 invariants in 12 ms
[2024-06-01 04:03:31] [INFO ] Implicit Places using invariants in 605 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 545/558 places, 1368/1379 transitions.
Applied a total of 0 rules in 20 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1433 ms. Remains : 545/558 places, 1368/1379 transitions.
// Phase 1: matrix 1368 rows 545 cols
[2024-06-01 04:03:31] [INFO ] Computed 56 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17706 resets) in 2420 ms. (413 steps per ms)
BEST_FIRST walk for 1000001 steps (3458 resets) in 906 ms. (1102 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:03:34] [INFO ] Invariant cache hit.
[2024-06-01 04:03:34] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 04:03:34] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 21 ms returned sat
[2024-06-01 04:03:35] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-06-01 04:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:03:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-06-01 04:03:35] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 21 ms returned sat
[2024-06-01 04:03:36] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2024-06-01 04:03:36] [INFO ] Computed and/alt/rep : 290/1323/290 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-06-01 04:03:37] [INFO ] Added : 53 causal constraints over 11 iterations in 1020 ms. Result :sat
Minimization took 1218 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 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 1368/1368 transitions.
Applied a total of 0 rules in 20 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 545/545 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 1368/1368 transitions.
Applied a total of 0 rules in 20 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-06-01 04:03:39] [INFO ] Invariant cache hit.
[2024-06-01 04:03:39] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-06-01 04:03:39] [INFO ] Invariant cache hit.
[2024-06-01 04:03:41] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2553 ms to find 0 implicit places.
[2024-06-01 04:03:41] [INFO ] Redundant transitions in 23 ms returned []
Running 1334 sub problems to find dead transitions.
[2024-06-01 04:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1913 variables, and 48 constraints, problems are : Problem set: 0 solved, 1334 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 40/43 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 1334/1334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 3 (OVERLAPS) 2/545 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/1913 variables, and 56 constraints, problems are : Problem set: 0 solved, 1334 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 0/1334 constraints, Known Traps: 0/0 constraints]
After SMT, in 60868ms problems are : Problem set: 0 solved, 1334 unsolved
Search for dead transitions found 0 dead transitions in 60881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63487 ms. Remains : 545/545 places, 1368/1368 transitions.
RANDOM walk for 40000 steps (702 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 213229 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 213229 steps, saw 142214 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 04:04:45] [INFO ] Invariant cache hit.
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) 19/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/154 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/292 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/307 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 155/462 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 34/496 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/545 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1368/1913 variables, 545/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1913 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1913 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1913/1913 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/154 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/292 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/307 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 155/462 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 34/496 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/545 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1368/1913 variables, 545/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1913 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1913 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1913 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1913/1913 variables, and 603 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2411ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 340 ms.
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 1368/1368 transitions.
Applied a total of 0 rules in 20 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 545/545 places, 1368/1368 transitions.
RANDOM walk for 40000 steps (692 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (129 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 185155 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185155 steps, saw 121810 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 04:04:51] [INFO ] Invariant cache hit.
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) 19/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/154 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/292 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/307 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 155/462 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 34/496 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/545 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1368/1913 variables, 545/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1913 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1913 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1913/1913 variables, and 601 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1443 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 123/154 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 136/292 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/307 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 155/462 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 34/496 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 49/545 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/545 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1368/1913 variables, 545/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1913 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1913 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1913 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1913/1913 variables, and 603 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 545/545 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 438 ms.
Support contains 1 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 1368/1368 transitions.
Applied a total of 0 rules in 24 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 545/545 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 1368/1368 transitions.
Applied a total of 0 rules in 22 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-06-01 04:04:54] [INFO ] Invariant cache hit.
[2024-06-01 04:04:55] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 04:04:55] [INFO ] Invariant cache hit.
[2024-06-01 04:04:57] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2024-06-01 04:04:57] [INFO ] Redundant transitions in 23 ms returned []
Running 1334 sub problems to find dead transitions.
[2024-06-01 04:04:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1913 variables, and 48 constraints, problems are : Problem set: 0 solved, 1334 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 40/43 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 1334/1334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 3 (OVERLAPS) 2/545 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/1913 variables, and 56 constraints, problems are : Problem set: 0 solved, 1334 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 0/1334 constraints, Known Traps: 0/0 constraints]
After SMT, in 60845ms problems are : Problem set: 0 solved, 1334 unsolved
Search for dead transitions found 0 dead transitions in 60859ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63870 ms. Remains : 545/545 places, 1368/1368 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 04:05:58] [INFO ] Invariant cache hit.
[2024-06-01 04:05:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 04:05:58] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 27 ms returned sat
[2024-06-01 04:05:59] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 04:05:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 04:05:59] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 26 ms returned sat
[2024-06-01 04:06:00] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 04:06:00] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 04:06:00] [INFO ] After 1044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2004 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-07a-UpperBounds-12 in 160541 ms.
Starting property specific reduction for ASLink-PT-07a-UpperBounds-15
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 1388 rows 566 cols
[2024-06-01 04:06:00] [INFO ] Computed 59 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (182 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (28 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:06:00] [INFO ] Invariant cache hit.
[2024-06-01 04:06:00] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 04:06:00] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-06-01 04:06:01] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-06-01 04:06:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:06:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 04:06:01] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 23 ms returned sat
[2024-06-01 04:06:02] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-06-01 04:06:02] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-06-01 04:06:03] [INFO ] Added : 70 causal constraints over 14 iterations in 1872 ms. Result :sat
Minimization took 503 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 566 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1081) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 1387/1387 transitions.
Reduce places removed 1 places and 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 2 place count 565 transition count 1385
Reduce places removed 2 places and 1 transitions.
Graph (complete) has 3465 edges and 563 vertex of which 562 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 562 transition count 1384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 562 transition count 1381
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 558 transition count 1381
Applied a total of 12 rules in 31 ms. Remains 558 /566 variables (removed 8) and now considering 1381/1387 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 558/566 places, 1381/1387 transitions.
// Phase 1: matrix 1381 rows 558 cols
[2024-06-01 04:06:04] [INFO ] Computed 57 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17459 resets) in 2375 ms. (420 steps per ms)
BEST_FIRST walk for 1000001 steps (3396 resets) in 913 ms. (1094 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 04:06:07] [INFO ] Invariant cache hit.
[2024-06-01 04:06:07] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-06-01 04:06:07] [INFO ] [Real]Absence check using 14 positive and 43 generalized place invariants in 20 ms returned sat
[2024-06-01 04:06:08] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2024-06-01 04:06:08] [INFO ] Computed and/alt/rep : 303/1335/303 causal constraints (skipped 1044 transitions) in 100 ms.
[2024-06-01 04:06:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 04:06:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-06-01 04:06:08] [INFO ] [Nat]Absence check using 14 positive and 43 generalized place invariants in 20 ms returned sat
[2024-06-01 04:06:09] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-06-01 04:06:09] [INFO ] Computed and/alt/rep : 303/1335/303 causal constraints (skipped 1044 transitions) in 98 ms.
[2024-06-01 04:06:10] [INFO ] Added : 53 causal constraints over 11 iterations in 1098 ms. Result :sat
Minimization took 1057 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 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 20 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 558/558 places, 1381/1381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 20 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-06-01 04:06:12] [INFO ] Invariant cache hit.
[2024-06-01 04:06:12] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-01 04:06:12] [INFO ] Invariant cache hit.
[2024-06-01 04:06:14] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
[2024-06-01 04:06:14] [INFO ] Redundant transitions in 24 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-06-01 04:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1939 variables, and 48 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 39/43 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 1347/1347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 3 (OVERLAPS) 2/558 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1939 variables, and 57 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 0/1347 constraints, Known Traps: 0/0 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63139 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (689 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 221545 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221545 steps, saw 148248 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 04:07:18] [INFO ] Invariant cache hit.
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) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/205 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 38/243 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/426 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/430 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 112/542 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/546 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 11/557 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1938 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1939 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1939/1939 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/205 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 38/243 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 04:07:19] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/426 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/430 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 112/542 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/542 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/546 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 11/557 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1381/1938 variables, 557/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1938 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1938 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/1939 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1939 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1939 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1939/1939 variables, and 618 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2240ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 1 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (709 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (134 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 172886 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172886 steps, saw 112891 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 04:07:24] [INFO ] Invariant cache hit.
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) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/205 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 38/243 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 183/426 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/430 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 112/542 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/546 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 11/557 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1381/1938 variables, 557/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1938 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/1939 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1939 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1939/1939 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/49 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 156/205 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 38/243 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 04:07:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 183/426 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/430 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 112/542 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/542 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/546 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 11/557 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1381/1938 variables, 557/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1938 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1938 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/1939 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1939 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1939 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1939/1939 variables, and 618 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 558/558 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2265ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 1 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 558/558 places, 1381/1381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-06-01 04:07:26] [INFO ] Invariant cache hit.
[2024-06-01 04:07:27] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-06-01 04:07:27] [INFO ] Invariant cache hit.
[2024-06-01 04:07:29] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2543 ms to find 0 implicit places.
[2024-06-01 04:07:29] [INFO ] Redundant transitions in 24 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-06-01 04:07:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/1939 variables, and 48 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 39/43 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 1347/1347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/556 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/556 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/556 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 3 (OVERLAPS) 2/558 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1939 variables, and 57 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/558 constraints, PredecessorRefiner: 0/1347 constraints, Known Traps: 0/0 constraints]
After SMT, in 60780ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63390 ms. Remains : 558/558 places, 1381/1381 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 04:08:29] [INFO ] Invariant cache hit.
[2024-06-01 04:08:30] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 04:08:30] [INFO ] [Real]Absence check using 14 positive and 43 generalized place invariants in 27 ms returned sat
[2024-06-01 04:08:30] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 04:08:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-06-01 04:08:30] [INFO ] [Nat]Absence check using 14 positive and 43 generalized place invariants in 26 ms returned sat
[2024-06-01 04:08:31] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 04:08:31] [INFO ] After 808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 04:08:31] [INFO ] After 1078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1920 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-07a-UpperBounds-15 in 151249 ms.
[2024-06-01 04:08:32] [INFO ] Flatten gal took : 255 ms
[2024-06-01 04:08:32] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 04:08:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 566 places, 1388 transitions and 5675 arcs took 15 ms.
Total runtime 1612547 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ASLink-PT-07a-UpperBounds-02
Could not compute solution for formula : ASLink-PT-07a-UpperBounds-07
Could not compute solution for formula : ASLink-PT-07a-UpperBounds-11
Could not compute solution for formula : ASLink-PT-07a-UpperBounds-12
Could not compute solution for formula : ASLink-PT-07a-UpperBounds-15
BK_STOP 1717214912750
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name ASLink-PT-07a-UpperBounds-02
ub formula formula --maxsum=/tmp/1448/ub_0_
ub formula name ASLink-PT-07a-UpperBounds-07
ub formula formula --maxsum=/tmp/1448/ub_1_
ub formula name ASLink-PT-07a-UpperBounds-11
ub formula formula --maxsum=/tmp/1448/ub_2_
ub formula name ASLink-PT-07a-UpperBounds-12
ub formula formula --maxsum=/tmp/1448/ub_3_
ub formula name ASLink-PT-07a-UpperBounds-15
ub formula formula --maxsum=/tmp/1448/ub_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="ASLink-PT-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-07a, 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 r464-smll-171620117800109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07a.tgz
mv ASLink-PT-07a 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 ;