About the Execution of GreatSPN+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 |
| 1720.579 | 1356322.00 | 1546746.00 | 4227.90 | 1 1 1 1 1 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.r003-smll-171620117000109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117000109
=====================================================================
--------------------
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 1716326161168
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:16:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 21:16:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:16:03] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-21 21:16:03] [INFO ] Transformed 1601 places.
[2024-05-21 21:16:03] [INFO ] Transformed 2373 transitions.
[2024-05-21 21:16:03] [INFO ] Found NUPN structural information;
[2024-05-21 21:16:03] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 579 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 99 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-05-21 21:16:03] [INFO ] Computed 308 invariants in 176 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 (50 resets) in 134 ms. (74 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 (62 resets) in 353 ms. (310 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-05-21 21:16:04] [INFO ] Invariant cache hit.
[2024-05-21 21:16:05] [INFO ] [Real]Absence check using 75 positive place invariants in 73 ms returned sat
[2024-05-21 21:16:05] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 108 ms returned sat
[2024-05-21 21:16:07] [INFO ] [Real]Absence check using state equation in 1698 ms returned sat
[2024-05-21 21:16:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:07] [INFO ] [Nat]Absence check using 75 positive place invariants in 61 ms returned sat
[2024-05-21 21:16:08] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 107 ms returned sat
[2024-05-21 21:16:09] [INFO ] [Nat]Absence check using state equation in 1577 ms returned sat
[2024-05-21 21:16:10] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 323 ms.
[2024-05-21 21:16:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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-05-21 21:16:12] [INFO ] [Real]Absence check using 75 positive place invariants in 61 ms returned sat
[2024-05-21 21:16:13] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 95 ms returned sat
[2024-05-21 21:16:14] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2024-05-21 21:16:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:15] [INFO ] [Nat]Absence check using 75 positive place invariants in 60 ms returned sat
[2024-05-21 21:16:15] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 108 ms returned sat
[2024-05-21 21:16:17] [INFO ] [Nat]Absence check using state equation in 1936 ms returned sat
[2024-05-21 21:16:17] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 190 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 21:16:20] [INFO ] [Real]Absence check using 75 positive place invariants in 62 ms returned sat
[2024-05-21 21:16:20] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 110 ms returned sat
[2024-05-21 21:16:21] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2024-05-21 21:16:21] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 230 ms.
[2024-05-21 21:16:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:22] [INFO ] [Nat]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-05-21 21:16:22] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 112 ms returned sat
[2024-05-21 21:16:24] [INFO ] [Nat]Absence check using state equation in 1124 ms returned sat
[2024-05-21 21:16:24] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 197 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 21:16:27] [INFO ] [Real]Absence check using 75 positive place invariants in 57 ms returned sat
[2024-05-21 21:16:27] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 110 ms returned sat
[2024-05-21 21:16:29] [INFO ] [Real]Absence check using state equation in 1721 ms returned sat
[2024-05-21 21:16:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 65 ms returned sat
[2024-05-21 21:16:30] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 81 ms returned sat
[2024-05-21 21:16:31] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2024-05-21 21:16:31] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 33 ms to minimize.
[2024-05-21 21:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2024-05-21 21:16:32] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 280 ms.
[2024-05-21 21:16:33] [INFO ] Added : 5 causal constraints over 1 iterations in 1205 ms. Result :sat
Minimization took 648 ms.
[2024-05-21 21:16:34] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-05-21 21:16:34] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 114 ms returned sat
[2024-05-21 21:16:36] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2024-05-21 21:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:36] [INFO ] [Nat]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-05-21 21:16:36] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 111 ms returned sat
[2024-05-21 21:16:38] [INFO ] [Nat]Absence check using state equation in 1726 ms returned sat
[2024-05-21 21:16:38] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 184 ms.
[2024-05-21 21:16:39] [INFO ] Added : 5 causal constraints over 1 iterations in 1331 ms. Result :unknown
[2024-05-21 21:16:40] [INFO ] [Real]Absence check using 75 positive place invariants in 57 ms returned sat
[2024-05-21 21:16:40] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 114 ms returned sat
[2024-05-21 21:16:41] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-05-21 21:16:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:42] [INFO ] [Nat]Absence check using 75 positive place invariants in 60 ms returned sat
[2024-05-21 21:16:42] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 84 ms returned sat
[2024-05-21 21:16:44] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2024-05-21 21:16:44] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 4 ms to minimize.
[2024-05-21 21:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2024-05-21 21:16:44] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 248 ms.
[2024-05-21 21:16:45] [INFO ] Added : 5 causal constraints over 1 iterations in 1402 ms. Result :unknown
[2024-05-21 21:16:46] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-05-21 21:16:46] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 87 ms returned sat
[2024-05-21 21:16:47] [INFO ] [Real]Absence check using state equation in 1322 ms returned sat
[2024-05-21 21:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:48] [INFO ] [Nat]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-05-21 21:16:48] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 112 ms returned sat
[2024-05-21 21:16:49] [INFO ] [Nat]Absence check using state equation in 1388 ms returned sat
[2024-05-21 21:16:50] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 4 ms to minimize.
[2024-05-21 21:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2024-05-21 21:16:50] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 203 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-21 21:16:53] [INFO ] [Real]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-05-21 21:16:53] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 112 ms returned sat
[2024-05-21 21:16:54] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2024-05-21 21:16:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:16:55] [INFO ] [Nat]Absence check using 75 positive place invariants in 59 ms returned sat
[2024-05-21 21:16:55] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 107 ms returned sat
[2024-05-21 21:16:56] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2024-05-21 21:16:57] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 204 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-21 21:17:00] [INFO ] [Real]Absence check using 75 positive place invariants in 52 ms returned sat
[2024-05-21 21:17:00] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 99 ms returned sat
[2024-05-21 21:17:01] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2024-05-21 21:17:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:02] [INFO ] [Nat]Absence check using 75 positive place invariants in 56 ms returned sat
[2024-05-21 21:17:02] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 100 ms returned sat
[2024-05-21 21:17:04] [INFO ] [Nat]Absence check using state equation in 1704 ms returned sat
[2024-05-21 21:17:04] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 185 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 21:17:07] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-05-21 21:17:07] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 116 ms returned sat
[2024-05-21 21:17:09] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2024-05-21 21:17:09] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 162 ms.
[2024-05-21 21:17:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 62 ms returned sat
[2024-05-21 21:17:10] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 111 ms returned sat
[2024-05-21 21:17:11] [INFO ] [Nat]Absence check using state equation in 1468 ms returned sat
[2024-05-21 21:17:12] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 182 ms.
[2024-05-21 21:17:14] [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-05-21 21:17:15] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2024-05-21 21:17:15] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 111 ms returned sat
[2024-05-21 21:17:17] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2024-05-21 21:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:17] [INFO ] [Nat]Absence check using 75 positive place invariants in 62 ms returned sat
[2024-05-21 21:17:17] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 85 ms returned sat
[2024-05-21 21:17:19] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 27 places in 480 ms of which 7 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 5 ms to minimize.
[2024-05-21 21:17:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1040 ms
[2024-05-21 21:17:21] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 184 ms.
[2024-05-21 21:17:22] [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 10
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)
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-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 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 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1559 transition count 2206
Reduce places removed 142 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 327 place count 1417 transition count 2205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 1416 transition count 2205
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 328 place count 1416 transition count 2056
Deduced a syphon composed of 149 places in 4 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 683 place count 1210 transition count 2056
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 684 place count 1210 transition count 2055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 685 place count 1209 transition count 2055
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 695 place count 1199 transition count 2002
Ensure Unique test removed 1 places
Iterating global reduction 5 with 11 rules applied. Total rules applied 706 place count 1198 transition count 2002
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 712 place count 1197 transition count 1997
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 715 place count 1194 transition count 1997
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 716 place count 1193 transition count 1989
Iterating global reduction 7 with 1 rules applied. Total rules applied 717 place count 1193 transition count 1989
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 1192 transition count 1981
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 1192 transition count 1981
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 720 place count 1191 transition count 1973
Iterating global reduction 7 with 1 rules applied. Total rules applied 721 place count 1191 transition count 1973
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 722 place count 1190 transition count 1965
Iterating global reduction 7 with 1 rules applied. Total rules applied 723 place count 1190 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 724 place count 1189 transition count 1957
Iterating global reduction 7 with 1 rules applied. Total rules applied 725 place count 1189 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 726 place count 1188 transition count 1949
Iterating global reduction 7 with 1 rules applied. Total rules applied 727 place count 1188 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 728 place count 1187 transition count 1941
Iterating global reduction 7 with 1 rules applied. Total rules applied 729 place count 1187 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 730 place count 1186 transition count 1933
Iterating global reduction 7 with 1 rules applied. Total rules applied 731 place count 1186 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 732 place count 1185 transition count 1925
Iterating global reduction 7 with 1 rules applied. Total rules applied 733 place count 1185 transition count 1925
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 734 place count 1184 transition count 1917
Iterating global reduction 7 with 1 rules applied. Total rules applied 735 place count 1184 transition count 1917
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 736 place count 1183 transition count 1909
Iterating global reduction 7 with 1 rules applied. Total rules applied 737 place count 1183 transition count 1909
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 738 place count 1182 transition count 1901
Iterating global reduction 7 with 1 rules applied. Total rules applied 739 place count 1182 transition count 1901
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 740 place count 1181 transition count 1893
Iterating global reduction 7 with 1 rules applied. Total rules applied 741 place count 1181 transition count 1893
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 742 place count 1180 transition count 1885
Iterating global reduction 7 with 1 rules applied. Total rules applied 743 place count 1180 transition count 1885
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 744 place count 1179 transition count 1877
Iterating global reduction 7 with 1 rules applied. Total rules applied 745 place count 1179 transition count 1877
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 746 place count 1178 transition count 1869
Iterating global reduction 7 with 1 rules applied. Total rules applied 747 place count 1178 transition count 1869
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 845 place count 1129 transition count 1820
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 852 place count 1129 transition count 1813
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 859 place count 1122 transition count 1813
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 867 place count 1122 transition count 1813
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 868 place count 1121 transition count 1812
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 882 place count 1107 transition count 1812
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 882 place count 1107 transition count 1785
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 55 rules applied. Total rules applied 937 place count 1079 transition count 1785
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 9 with 8 rules applied. Total rules applied 945 place count 1071 transition count 1785
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 945 place count 1071 transition count 1784
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 947 place count 1070 transition count 1784
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 963 place count 1062 transition count 1776
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 970 place count 1055 transition count 1769
Iterating global reduction 10 with 7 rules applied. Total rules applied 977 place count 1055 transition count 1769
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 984 place count 1055 transition count 1762
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 991 place count 1048 transition count 1762
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 997 place count 1048 transition count 1762
Applied a total of 997 rules in 3304 ms. Remains 1048 /1601 variables (removed 553) and now considering 1762/2348 (removed 586) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3321 ms. Remains : 1048/1601 places, 1762/2348 transitions.
// Phase 1: matrix 1762 rows 1048 cols
[2024-05-21 21:17:26] [INFO ] Computed 184 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10899 resets) in 3992 ms. (250 steps per ms)
FORMULA ASLink-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000005 steps (10738 resets) in 11454 ms. (611 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-05-21 21:17:42] [INFO ] Invariant cache hit.
[2024-05-21 21:17:42] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:17:42] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 59 ms returned sat
[2024-05-21 21:17:43] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2024-05-21 21:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:17:43] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 21:17:43] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:17:44] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2024-05-21 21:17:44] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 131 ms.
[2024-05-21 21:17:58] [INFO ] Added : 521 causal constraints over 105 iterations in 13677 ms. Result :sat
Minimization took 1247 ms.
[2024-05-21 21:17:59] [INFO ] [Real]Absence check using 46 positive place invariants in 25 ms returned sat
[2024-05-21 21:17:59] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 59 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2024-05-21 21:18:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:18:00] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:18:00] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 59 ms returned sat
[2024-05-21 21:18:01] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2024-05-21 21:18:01] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 130 ms.
[2024-05-21 21:18:13] [INFO ] Added : 481 causal constraints over 97 iterations in 12152 ms. Result :sat
Minimization took 1197 ms.
[2024-05-21 21:18:15] [INFO ] [Real]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 21:18:15] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:18:16] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2024-05-21 21:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:18:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:18:16] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 62 ms returned sat
[2024-05-21 21:18:17] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2024-05-21 21:18:17] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 143 ms.
[2024-05-21 21:18:28] [INFO ] Added : 425 causal constraints over 85 iterations in 11508 ms. Result :sat
Minimization took 1230 ms.
[2024-05-21 21:18:30] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:18:30] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:18:31] [INFO ] [Real]Absence check using state equation in 968 ms returned sat
[2024-05-21 21:18:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:18:31] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:18:31] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 57 ms returned sat
[2024-05-21 21:18:32] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2024-05-21 21:18:33] [INFO ] Deduced a trap composed of 101 places in 378 ms of which 4 ms to minimize.
[2024-05-21 21:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2024-05-21 21:18:33] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 131 ms.
[2024-05-21 21:18:46] [INFO ] Added : 517 causal constraints over 104 iterations in 13111 ms. Result :sat
Minimization took 1380 ms.
[2024-05-21 21:18:47] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:18:48] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:18:48] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-21 21:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:18:49] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 21:18:49] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:18:50] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-21 21:18:50] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 152 ms.
[2024-05-21 21:19:03] [INFO ] Added : 511 causal constraints over 103 iterations in 12720 ms. Result :sat
Minimization took 1296 ms.
[2024-05-21 21:19:04] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:19:04] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 56 ms returned sat
[2024-05-21 21:19:05] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2024-05-21 21:19:05] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 134 ms.
[2024-05-21 21:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:06] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 21:19:06] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 67 ms returned sat
[2024-05-21 21:19:07] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2024-05-21 21:19:07] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 133 ms.
[2024-05-21 21:19:21] [INFO ] Added : 544 causal constraints over 109 iterations in 13882 ms. Result :sat
Minimization took 1326 ms.
[2024-05-21 21:19:22] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:19:22] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:19:23] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2024-05-21 21:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:24] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:19:24] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:19:24] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2024-05-21 21:19:25] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 134 ms.
[2024-05-21 21:19:29] [INFO ] Added : 156 causal constraints over 32 iterations in 4307 ms. Result :sat
Minimization took 1065 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]
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 53 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 53 ms. Remains : 1048/1048 places, 1762/1762 transitions.
[2024-05-21 21:19:37] [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 (10688 resets) in 3766 ms. (265 steps per ms)
BEST_FIRST walk for 7000007 steps (10752 resets) in 11348 ms. (616 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-05-21 21:19:52] [INFO ] Invariant cache hit.
[2024-05-21 21:19:52] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-05-21 21:19:52] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 61 ms returned sat
[2024-05-21 21:19:53] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-21 21:19:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:53] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:19:53] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 57 ms returned sat
[2024-05-21 21:19:54] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-21 21:19:54] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 133 ms.
[2024-05-21 21:20:07] [INFO ] Added : 521 causal constraints over 105 iterations in 13187 ms. Result :sat
Minimization took 1287 ms.
[2024-05-21 21:20:09] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:20:09] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 57 ms returned sat
[2024-05-21 21:20:10] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2024-05-21 21:20:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:20:10] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:20:11] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2024-05-21 21:20:11] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 128 ms.
[2024-05-21 21:20:23] [INFO ] Added : 481 causal constraints over 97 iterations in 11959 ms. Result :sat
Minimization took 1205 ms.
[2024-05-21 21:20:24] [INFO ] [Real]Absence check using 46 positive place invariants in 25 ms returned sat
[2024-05-21 21:20:24] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:20:25] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-21 21:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:25] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:20:25] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:20:26] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2024-05-21 21:20:27] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 136 ms.
[2024-05-21 21:20:38] [INFO ] Added : 425 causal constraints over 85 iterations in 11294 ms. Result :sat
Minimization took 1248 ms.
[2024-05-21 21:20:39] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:20:39] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 61 ms returned sat
[2024-05-21 21:20:40] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2024-05-21 21:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:40] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:20:41] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 59 ms returned sat
[2024-05-21 21:20:41] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2024-05-21 21:20:42] [INFO ] Deduced a trap composed of 101 places in 329 ms of which 5 ms to minimize.
[2024-05-21 21:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2024-05-21 21:20:42] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 127 ms.
[2024-05-21 21:20:55] [INFO ] Added : 517 causal constraints over 104 iterations in 13111 ms. Result :sat
Minimization took 1422 ms.
[2024-05-21 21:20:57] [INFO ] [Real]Absence check using 46 positive place invariants in 24 ms returned sat
[2024-05-21 21:20:57] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 60 ms returned sat
[2024-05-21 21:20:58] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2024-05-21 21:20:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:58] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2024-05-21 21:20:58] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 57 ms returned sat
[2024-05-21 21:20:59] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2024-05-21 21:20:59] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 132 ms.
[2024-05-21 21:21:12] [INFO ] Added : 511 causal constraints over 103 iterations in 12862 ms. Result :sat
Minimization took 1302 ms.
[2024-05-21 21:21:14] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:21:14] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 59 ms returned sat
[2024-05-21 21:21:14] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2024-05-21 21:21:15] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 127 ms.
[2024-05-21 21:21:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2024-05-21 21:21:15] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 43 ms returned sat
[2024-05-21 21:21:16] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2024-05-21 21:21:16] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 128 ms.
[2024-05-21 21:21:30] [INFO ] Added : 544 causal constraints over 109 iterations in 13785 ms. Result :sat
Minimization took 1347 ms.
[2024-05-21 21:21:32] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2024-05-21 21:21:32] [INFO ] [Real]Absence check using 46 positive and 138 generalized place invariants in 44 ms returned sat
[2024-05-21 21:21:32] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2024-05-21 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 27 ms returned sat
[2024-05-21 21:21:33] [INFO ] [Nat]Absence check using 46 positive and 138 generalized place invariants in 58 ms returned sat
[2024-05-21 21:21:34] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-21 21:21:34] [INFO ] Computed and/alt/rep : 698/2643/698 causal constraints (skipped 1027 transitions) in 129 ms.
[2024-05-21 21:21:38] [INFO ] Added : 156 causal constraints over 32 iterations in 4255 ms. Result :sat
Minimization took 1046 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]
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 40 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 41 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 39 ms. Remains 1048 /1048 variables (removed 0) and now considering 1762/1762 (removed 0) transitions.
[2024-05-21 21:21:46] [INFO ] Invariant cache hit.
[2024-05-21 21:21:47] [INFO ] Implicit Places using invariants in 1332 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-05-21 21:21:47] [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 1339 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 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 971 transition count 1632
Reduce places removed 130 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 132 rules applied. Total rules applied 269 place count 841 transition count 1630
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 271 place count 839 transition count 1630
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 271 place count 839 transition count 1596
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 340 place count 804 transition count 1596
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 352 place count 800 transition count 1588
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 360 place count 792 transition count 1588
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 375 place count 777 transition count 1573
Iterating global reduction 5 with 15 rules applied. Total rules applied 390 place count 777 transition count 1573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 393 place count 777 transition count 1570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 393 place count 777 transition count 1569
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 395 place count 776 transition count 1569
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 398 place count 773 transition count 1566
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 773 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 402 place count 772 transition count 1565
Iterating global reduction 6 with 1 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
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 525 place count 711 transition count 1504
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 531 place count 711 transition count 1498
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 538 place count 704 transition count 1491
Iterating global reduction 7 with 7 rules applied. Total rules applied 545 place count 704 transition count 1491
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 552 place count 704 transition count 1484
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 569 place count 704 transition count 1467
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 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 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 609 place count 686 transition count 1466
Applied a total of 609 rules in 467 ms. Remains 686 /978 variables (removed 292) and now considering 1466/1762 (removed 296) transitions.
// Phase 1: matrix 1466 rows 686 cols
[2024-05-21 21:21:48] [INFO ] Computed 101 invariants in 37 ms
[2024-05-21 21:21:49] [INFO ] Implicit Places using invariants in 976 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-05-21 21:21:49] [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, 359, 364, 439, 445, 450, 526, 532, 537, 612, 618, 623, 73, 159, 171, 250, 336, 353, 422, 508, 595]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 984 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 644/1048 places, 1466/1762 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 617 transition count 1439
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 617 transition count 1439
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 611 transition count 1433
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 611 transition count 1433
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 597 transition count 1419
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 115 place count 597 transition count 1398
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 136 place count 576 transition count 1398
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 142 place count 576 transition count 1392
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 148 place count 570 transition count 1392
Applied a total of 148 rules in 177 ms. Remains 570 /644 variables (removed 74) and now considering 1392/1466 (removed 74) transitions.
// Phase 1: matrix 1392 rows 570 cols
[2024-05-21 21:21:49] [INFO ] Computed 59 invariants in 17 ms
[2024-05-21 21:21:49] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-05-21 21:21:50] [INFO ] Invariant cache hit.
[2024-05-21 21:21:51] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 570/1048 places, 1392/1762 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5681 ms. Remains : 570/1048 places, 1392/1762 transitions.
[2024-05-21 21:21:51] [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 (17209 resets) in 2714 ms. (368 steps per ms)
BEST_FIRST walk for 7000004 steps (23879 resets) in 6853 ms. (1021 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-05-21 21:22:01] [INFO ] Invariant cache hit.
[2024-05-21 21:22:01] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:01] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 19 ms returned sat
[2024-05-21 21:22:02] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-21 21:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:22:02] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:02] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2024-05-21 21:22:03] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 102 ms.
[2024-05-21 21:22:03] [INFO ] Added : 44 causal constraints over 9 iterations in 966 ms. Result :sat
Minimization took 1419 ms.
[2024-05-21 21:22:05] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2024-05-21 21:22:05] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 27 ms returned sat
[2024-05-21 21:22:06] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-21 21:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:06] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:22:06] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-05-21 21:22:07] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 102 ms.
[2024-05-21 21:22:08] [INFO ] Added : 88 causal constraints over 18 iterations in 1694 ms. Result :sat
Minimization took 1355 ms.
[2024-05-21 21:22:10] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:22:10] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 27 ms returned sat
[2024-05-21 21:22:10] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-21 21:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:11] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:11] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2024-05-21 21:22:11] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 100 ms.
[2024-05-21 21:22:12] [INFO ] Added : 44 causal constraints over 9 iterations in 940 ms. Result :sat
Minimization took 1344 ms.
[2024-05-21 21:22:14] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-05-21 21:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:15] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-21 21:22:15] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 103 ms.
[2024-05-21 21:22:16] [INFO ] Added : 31 causal constraints over 9 iterations in 851 ms. Result :sat
Minimization took 1304 ms.
[2024-05-21 21:22:17] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:22:17] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:18] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-05-21 21:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:18] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:19] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-21 21:22:19] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:22:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-21 21:22:19] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 105 ms.
[2024-05-21 21:22:20] [INFO ] Added : 36 causal constraints over 9 iterations in 892 ms. Result :sat
Minimization took 1362 ms.
[2024-05-21 21:22:21] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:21] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:22] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-21 21:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:22] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:23] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-21 21:22:23] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 103 ms.
[2024-05-21 21:22:25] [INFO ] Added : 43 causal constraints over 9 iterations in 2504 ms. Result :sat
Minimization took 1566 ms.
[2024-05-21 21:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:27] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:22:28] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-05-21 21:22:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:28] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:28] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-21 21:22:29] [INFO ] Computed and/alt/rep : 321/1414/321 causal constraints (skipped 1037 transitions) in 102 ms.
[2024-05-21 21:22:29] [INFO ] Added : 34 causal constraints over 7 iterations in 771 ms. Result :sat
Minimization took 1334 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-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1392/1392 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 569 transition count 1391
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 569 transition count 1391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 568 transition count 1390
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 568 transition count 1390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 567 transition count 1389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 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 8 place count 566 transition count 1388
Applied a total of 8 rules in 102 ms. Remains 566 /570 variables (removed 4) and now considering 1388/1392 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 566/570 places, 1388/1392 transitions.
// Phase 1: matrix 1388 rows 566 cols
[2024-05-21 21:22:37] [INFO ] Computed 59 invariants in 19 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 (17309 resets) in 2662 ms. (375 steps per ms)
BEST_FIRST walk for 5000004 steps (17021 resets) in 4840 ms. (1032 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-05-21 21:22:44] [INFO ] Invariant cache hit.
[2024-05-21 21:22:44] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:44] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:45] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2024-05-21 21:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 21:22:45] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:46] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-21 21:22:46] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-05-21 21:22:47] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 4 ms to minimize.
[2024-05-21 21:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2024-05-21 21:22:47] [INFO ] Added : 47 causal constraints over 10 iterations in 1470 ms. Result :sat
Minimization took 799 ms.
[2024-05-21 21:22:48] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:22:48] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:49] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2024-05-21 21:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:22:49] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 27 ms returned sat
[2024-05-21 21:22:50] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-21 21:22:50] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 106 ms.
[2024-05-21 21:22:51] [INFO ] Added : 70 causal constraints over 15 iterations in 1321 ms. Result :sat
Minimization took 763 ms.
[2024-05-21 21:22:52] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:52] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-21 21:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2024-05-21 21:22:54] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 109 ms.
[2024-05-21 21:22:54] [INFO ] Added : 23 causal constraints over 6 iterations in 716 ms. Result :sat
Minimization took 788 ms.
[2024-05-21 21:22:55] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:55] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:56] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2024-05-21 21:22:56] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 103 ms.
[2024-05-21 21:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:56] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:22:57] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2024-05-21 21:22:57] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 102 ms.
[2024-05-21 21:22:58] [INFO ] Added : 18 causal constraints over 4 iterations in 712 ms. Result :sat
Minimization took 765 ms.
[2024-05-21 21:22:59] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:59] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:22:59] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-05-21 21:22:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:22:59] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:23:00] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2024-05-21 21:23:00] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 103 ms.
[2024-05-21 21:23:00] [INFO ] Added : 10 causal constraints over 3 iterations in 425 ms. Result :sat
Minimization took 690 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 20 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 20 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-05-21 21:23:03] [INFO ] Invariant cache hit.
[2024-05-21 21:23:03] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-21 21:23:03] [INFO ] Invariant cache hit.
[2024-05-21 21:23:05] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
[2024-05-21 21:23:05] [INFO ] Redundant transitions in 124 ms returned []
Running 1354 sub problems to find dead transitions.
[2024-05-21 21:23:06] [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 30072 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
SMT process timed out in 61252ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 61310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64220 ms. Remains : 566/566 places, 1388/1388 transitions.
RANDOM walk for 40000 steps (672 resets) in 1601 ms. (24 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (126 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (134 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (134 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (138 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (131 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (145 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (135 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (136 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (132 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 100040 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 10
Probabilistic random walk after 100040 steps, saw 58864 distinct states, run finished after 3005 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-21 21:24:11] [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 3030 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 2616 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 5663ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2925 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 21 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.
RANDOM walk for 40000 steps (675 resets) in 688 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (141 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (134 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (135 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (142 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (139 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (140 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (143 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (133 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (135 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (136 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 103518 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 10
Probabilistic random walk after 103518 steps, saw 61049 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-21 21:24:24] [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 2657 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 2580 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 5252ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1806 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 20 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 20 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-05-21 21:24:31] [INFO ] Invariant cache hit.
[2024-05-21 21:24:31] [INFO ] Implicit Places using invariants in 768 ms returned []
[2024-05-21 21:24:31] [INFO ] Invariant cache hit.
[2024-05-21 21:24:33] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2837 ms to find 0 implicit places.
[2024-05-21 21:24:33] [INFO ] Redundant transitions in 39 ms returned []
Running 1354 sub problems to find dead transitions.
[2024-05-21 21:24:34] [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 30036 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
SMT process timed out in 60961ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 60980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63888 ms. Remains : 566/566 places, 1388/1388 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 25 ms. Remains 566 /566 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-05-21 21:25:35] [INFO ] Invariant cache hit.
[2024-05-21 21:25:35] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 21:25:35] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 31 ms returned sat
[2024-05-21 21:25:36] [INFO ] After 1045ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
TRAPS : Iteration 0
[2024-05-21 21:25:36] [INFO ] After 1217ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
[2024-05-21 21:25:36] [INFO ] After 1685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2024-05-21 21:25:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-21 21:25:36] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 29 ms returned sat
[2024-05-21 21:25:38] [INFO ] After 1069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-21 21:25:38] [INFO ] After 1833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-21 21:25:39] [INFO ] After 2604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 4334 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-05-21 21:25:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (175 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (33 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:25:39] [INFO ] Invariant cache hit.
[2024-05-21 21:25:39] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:25:39] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 27 ms returned sat
[2024-05-21 21:25:40] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2024-05-21 21:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:25:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:25:40] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:25:41] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-21 21:25:41] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-05-21 21:25:42] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 4 ms to minimize.
[2024-05-21 21:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2024-05-21 21:25:42] [INFO ] Added : 47 causal constraints over 10 iterations in 1499 ms. Result :sat
Minimization took 515 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.2 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 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 13 place count 558 transition count 1381
Applied a total of 13 rules in 37 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 38 ms. Remains : 558/566 places, 1381/1387 transitions.
// Phase 1: matrix 1381 rows 558 cols
[2024-05-21 21:25:43] [INFO ] Computed 57 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17374 resets) in 2585 ms. (386 steps per ms)
BEST_FIRST walk for 1000001 steps (3398 resets) in 964 ms. (1036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:25:46] [INFO ] Invariant cache hit.
[2024-05-21 21:25:46] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:25:46] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-21 21:25:47] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-05-21 21:25:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:25:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-21 21:25:47] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-21 21:25:48] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2024-05-21 21:25:48] [INFO ] Computed and/alt/rep : 303/1335/303 causal constraints (skipped 1044 transitions) in 120 ms.
[2024-05-21 21:25:49] [INFO ] Added : 47 causal constraints over 10 iterations in 967 ms. Result :sat
Minimization took 996 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 20 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 19 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-05-21 21:25:50] [INFO ] Invariant cache hit.
[2024-05-21 21:25:51] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-21 21:25:51] [INFO ] Invariant cache hit.
[2024-05-21 21:25:53] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2024-05-21 21:25:53] [INFO ] Redundant transitions in 24 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-05-21 21:25:53] [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 30028 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
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 558/1939 variables, and 57 constraints, problems are : Problem set: 0 solved, 1347 unsolved in 30029 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 60895ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63877 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (691 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (132 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 198075 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 198075 steps, saw 131186 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-21 21:26:57] [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 1138 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 1096 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 2266ms 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 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 20 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (671 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (132 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (134 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 193613 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 193613 steps, saw 127894 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-21 21:27:03] [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 1127 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 1143 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 2290ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 355 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 20 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-05-21 21:27:05] [INFO ] Invariant cache hit.
[2024-05-21 21:27:06] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-21 21:27:06] [INFO ] Invariant cache hit.
[2024-05-21 21:27:08] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2986 ms to find 0 implicit places.
[2024-05-21 21:27:08] [INFO ] Redundant transitions in 26 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-05-21 21:27:08] [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 30029 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 30030 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 60891ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60906ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63946 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-05-21 21:28:09] [INFO ] Invariant cache hit.
[2024-05-21 21:28:09] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 21:28:09] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 29 ms returned sat
[2024-05-21 21:28:10] [INFO ] After 851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:28:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 21:28:10] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-21 21:28:11] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:28:11] [INFO ] After 846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:28:11] [INFO ] After 1107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1992 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 152285 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-05-21 21:28:11] [INFO ] Computed 59 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (174 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (36 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:28:11] [INFO ] Invariant cache hit.
[2024-05-21 21:28:11] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-21 21:28:11] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:28:12] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-05-21 21:28:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:28:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:28:12] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:28:13] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-21 21:28:13] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 105 ms.
[2024-05-21 21:28:14] [INFO ] Added : 70 causal constraints over 15 iterations in 1333 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 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 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 27 ms. Remains : 560/566 places, 1383/1387 transitions.
// Phase 1: matrix 1383 rows 560 cols
[2024-05-21 21:28:15] [INFO ] Computed 57 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17416 resets) in 2606 ms. (383 steps per ms)
BEST_FIRST walk for 1000001 steps (3422 resets) in 943 ms. (1059 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:28:18] [INFO ] Invariant cache hit.
[2024-05-21 21:28:18] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:28:18] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 24 ms returned sat
[2024-05-21 21:28:19] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-21 21:28:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:28:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-21 21:28:19] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 22 ms returned sat
[2024-05-21 21:28:20] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2024-05-21 21:28:20] [INFO ] Computed and/alt/rep : 305/1345/305 causal constraints (skipped 1044 transitions) in 103 ms.
[2024-05-21 21:28:20] [INFO ] Added : 33 causal constraints over 7 iterations in 796 ms. Result :sat
Minimization took 1769 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 19 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 19 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 19 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-21 21:28:23] [INFO ] Invariant cache hit.
[2024-05-21 21:28:23] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-21 21:28:23] [INFO ] Invariant cache hit.
[2024-05-21 21:28:25] [INFO ] Implicit Places using invariants and state equation in 1800 ms returned []
Implicit Place search using SMT with State Equation took 2529 ms to find 0 implicit places.
[2024-05-21 21:28:25] [INFO ] Redundant transitions in 25 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-05-21 21:28:25] [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 30035 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 30027 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 60922ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60939ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63522 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (679 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 190549 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190549 steps, saw 125768 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-21 21:29:29] [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 1225 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 1121 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 2361ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 512 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 21 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (689 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 184587 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 184587 steps, saw 121393 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-21 21:29:35] [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 1197 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 1113 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 2327ms 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 19 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 19 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 19 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-21 21:29:38] [INFO ] Invariant cache hit.
[2024-05-21 21:29:39] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-21 21:29:39] [INFO ] Invariant cache hit.
[2024-05-21 21:29:41] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2024-05-21 21:29:41] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-05-21 21:29:41] [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 30028 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 60907ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60921ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63609 ms. Remains : 560/560 places, 1383/1383 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 21:30:42] [INFO ] Invariant cache hit.
[2024-05-21 21:30:42] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 21:30:42] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 29 ms returned sat
[2024-05-21 21:30:43] [INFO ] After 845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:30:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 21:30:43] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-21 21:30:44] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:30:44] [INFO ] After 831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:30:44] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1969 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 152883 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-05-21 21:30:44] [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 (171 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (31 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:30:44] [INFO ] Invariant cache hit.
[2024-05-21 21:30:44] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:30:44] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:30:45] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2024-05-21 21:30:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:30:45] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 24 ms returned sat
[2024-05-21 21:30:46] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-21 21:30:46] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 103 ms.
[2024-05-21 21:30:46] [INFO ] Added : 23 causal constraints over 6 iterations in 685 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.0 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 27 ms. Remains : 560/566 places, 1383/1387 transitions.
// Phase 1: matrix 1383 rows 560 cols
[2024-05-21 21:30:47] [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 (17536 resets) in 2553 ms. (391 steps per ms)
BEST_FIRST walk for 1000001 steps (3430 resets) in 944 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:30:50] [INFO ] Invariant cache hit.
[2024-05-21 21:30:51] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:30:51] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 23 ms returned sat
[2024-05-21 21:30:51] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-05-21 21:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:30:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:30:51] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 23 ms returned sat
[2024-05-21 21:30:52] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2024-05-21 21:30:52] [INFO ] Computed and/alt/rep : 305/1345/305 causal constraints (skipped 1044 transitions) in 102 ms.
[2024-05-21 21:30:53] [INFO ] Added : 33 causal constraints over 7 iterations in 782 ms. Result :sat
Minimization took 1752 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 19 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 19 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 19 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-21 21:30:55] [INFO ] Invariant cache hit.
[2024-05-21 21:30:56] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-05-21 21:30:56] [INFO ] Invariant cache hit.
[2024-05-21 21:30:58] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2024-05-21 21:30:58] [INFO ] Redundant transitions in 24 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-05-21 21:30:58] [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 30034 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: (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 30027 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 60890ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63890 ms. Remains : 560/560 places, 1383/1383 transitions.
RANDOM walk for 40000 steps (654 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (132 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (135 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 188577 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188577 steps, saw 124313 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-21 21:32: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) 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 1148 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 2369ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 389 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.
RANDOM walk for 40000 steps (684 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (137 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (137 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 189403 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 189403 steps, saw 124931 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-21 21:32: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) 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 1201 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 1133 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 2343ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 620 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 19 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 19 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 19 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-21 21:32:11] [INFO ] Invariant cache hit.
[2024-05-21 21:32:12] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-21 21:32:12] [INFO ] Invariant cache hit.
[2024-05-21 21:32:14] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2024-05-21 21:32:14] [INFO ] Redundant transitions in 25 ms returned []
Running 1349 sub problems to find dead transitions.
[2024-05-21 21:32:14] [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 30032 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 30029 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 60916ms problems are : Problem set: 0 solved, 1349 unsolved
Search for dead transitions found 0 dead transitions in 60931ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63900 ms. Remains : 560/560 places, 1383/1383 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 560 /560 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 21:33:15] [INFO ] Invariant cache hit.
[2024-05-21 21:33:15] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-21 21:33:15] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 29 ms returned sat
[2024-05-21 21:33:16] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:33:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 21:33:16] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 30 ms returned sat
[2024-05-21 21:33:16] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:33:17] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:33:17] [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 1972 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 152623 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-05-21 21:33:17] [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 (169 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (32 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:33:17] [INFO ] Invariant cache hit.
[2024-05-21 21:33:17] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:33:17] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:33:17] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2024-05-21 21:33:18] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 110 ms.
[2024-05-21 21:33:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:33:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-21 21:33:18] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:33:18] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2024-05-21 21:33:19] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-05-21 21:33:19] [INFO ] Added : 18 causal constraints over 4 iterations in 701 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 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 2 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 33 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 34 ms. Remains : 558/566 places, 1379/1387 transitions.
// Phase 1: matrix 1379 rows 558 cols
[2024-05-21 21:33:20] [INFO ] Computed 58 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17399 resets) in 2549 ms. (392 steps per ms)
BEST_FIRST walk for 1000001 steps (3387 resets) in 950 ms. (1051 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:33:23] [INFO ] Invariant cache hit.
[2024-05-21 21:33:23] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-21 21:33:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 24 ms returned sat
[2024-05-21 21:33:24] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2024-05-21 21:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:33:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-21 21:33:24] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 23 ms returned sat
[2024-05-21 21:33:25] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2024-05-21 21:33:25] [INFO ] Computed and/alt/rep : 301/1332/301 causal constraints (skipped 1044 transitions) in 100 ms.
[2024-05-21 21:33:25] [INFO ] Added : 18 causal constraints over 4 iterations in 554 ms. Result :sat
Minimization took 704 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 19 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 19 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 19 ms. Remains 558 /558 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2024-05-21 21:33:27] [INFO ] Invariant cache hit.
[2024-05-21 21:33:27] [INFO ] Implicit Places using invariants in 852 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 854 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 2 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 84 ms. Remains 546 /557 variables (removed 11) and now considering 1368/1379 (removed 11) transitions.
// Phase 1: matrix 1368 rows 546 cols
[2024-05-21 21:33:27] [INFO ] Computed 57 invariants in 23 ms
[2024-05-21 21:33:28] [INFO ] Implicit Places using invariants in 853 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 855 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 33 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 1846 ms. Remains : 545/558 places, 1368/1379 transitions.
// Phase 1: matrix 1368 rows 545 cols
[2024-05-21 21:33:28] [INFO ] Computed 56 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (17405 resets) in 2656 ms. (376 steps per ms)
BEST_FIRST walk for 1000001 steps (3410 resets) in 952 ms. (1049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:33:32] [INFO ] Invariant cache hit.
[2024-05-21 21:33:32] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-21 21:33:32] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 24 ms returned sat
[2024-05-21 21:33:33] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2024-05-21 21:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:33:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-21 21:33:33] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 22 ms returned sat
[2024-05-21 21:33:34] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-21 21:33:34] [INFO ] Computed and/alt/rep : 290/1323/290 causal constraints (skipped 1044 transitions) in 102 ms.
[2024-05-21 21:33:34] [INFO ] Added : 13 causal constraints over 3 iterations in 467 ms. Result :sat
Minimization took 1106 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 19 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 19 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 19 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-05-21 21:33:36] [INFO ] Invariant cache hit.
[2024-05-21 21:33:36] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-05-21 21:33:36] [INFO ] Invariant cache hit.
[2024-05-21 21:33:38] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2024-05-21 21:33:38] [INFO ] Redundant transitions in 24 ms returned []
Running 1334 sub problems to find dead transitions.
[2024-05-21 21:33:38] [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 30026 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 30037 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 60922ms problems are : Problem set: 0 solved, 1334 unsolved
Search for dead transitions found 0 dead transitions in 60936ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63910 ms. Remains : 545/545 places, 1368/1368 transitions.
RANDOM walk for 40000 steps (686 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (134 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161733 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161733 steps, saw 104774 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-21 21:34:43] [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 1370 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 1092 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 2470ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 557 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 19 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 19 ms. Remains : 545/545 places, 1368/1368 transitions.
RANDOM walk for 40000 steps (695 resets) in 600 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (134 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 197060 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 2
Probabilistic random walk after 197060 steps, saw 130430 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-21 21:34:49] [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 1440 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 1093 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 552 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 19 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 19 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 19 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2024-05-21 21:34:52] [INFO ] Invariant cache hit.
[2024-05-21 21:34:53] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-21 21:34:53] [INFO ] Invariant cache hit.
[2024-05-21 21:34:55] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
[2024-05-21 21:34:55] [INFO ] Redundant transitions in 25 ms returned []
Running 1334 sub problems to find dead transitions.
[2024-05-21 21:34:55] [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 30027 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 30029 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 60874ms problems are : Problem set: 0 solved, 1334 unsolved
Search for dead transitions found 0 dead transitions in 60888ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63831 ms. Remains : 545/545 places, 1368/1368 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 19 ms. Remains 545 /545 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 21:35:56] [INFO ] Invariant cache hit.
[2024-05-21 21:35:56] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-21 21:35:56] [INFO ] [Real]Absence check using 13 positive and 43 generalized place invariants in 40 ms returned sat
[2024-05-21 21:35:57] [INFO ] After 1064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:35:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-21 21:35:57] [INFO ] [Nat]Absence check using 13 positive and 43 generalized place invariants in 28 ms returned sat
[2024-05-21 21:35:58] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:35:58] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:35:58] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2153 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 161480 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-05-21 21:35:58] [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 (175 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10000 steps (38 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:35:58] [INFO ] Invariant cache hit.
[2024-05-21 21:35:58] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:35:58] [INFO ] [Real]Absence check using 12 positive and 47 generalized place invariants in 25 ms returned sat
[2024-05-21 21:35:59] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2024-05-21 21:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:35:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-21 21:35:59] [INFO ] [Nat]Absence check using 12 positive and 47 generalized place invariants in 26 ms returned sat
[2024-05-21 21:36:00] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-21 21:36:00] [INFO ] Computed and/alt/rep : 310/1352/310 causal constraints (skipped 1044 transitions) in 104 ms.
[2024-05-21 21:36:00] [INFO ] Added : 10 causal constraints over 3 iterations in 413 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 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 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 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-05-21 21:36:01] [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 (17472 resets) in 2548 ms. (392 steps per ms)
BEST_FIRST walk for 1000001 steps (3381 resets) in 945 ms. (1057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 21:36:04] [INFO ] Invariant cache hit.
[2024-05-21 21:36:04] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-21 21:36:04] [INFO ] [Real]Absence check using 14 positive and 43 generalized place invariants in 24 ms returned sat
[2024-05-21 21:36:05] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-05-21 21:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:36:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-21 21:36:05] [INFO ] [Nat]Absence check using 14 positive and 43 generalized place invariants in 23 ms returned sat
[2024-05-21 21:36:06] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-05-21 21:36:06] [INFO ] Computed and/alt/rep : 303/1335/303 causal constraints (skipped 1044 transitions) in 106 ms.
[2024-05-21 21:36:07] [INFO ] Added : 34 causal constraints over 9 iterations in 973 ms. Result :sat
Minimization took 1046 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 19 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 20 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 19 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-05-21 21:36:08] [INFO ] Invariant cache hit.
[2024-05-21 21:36:09] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-21 21:36:09] [INFO ] Invariant cache hit.
[2024-05-21 21:36:11] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2888 ms to find 0 implicit places.
[2024-05-21 21:36:11] [INFO ] Redundant transitions in 24 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-05-21 21:36:11] [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 30031 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 30030 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 60884ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63837 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (650 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (131 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (130 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 192917 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 192917 steps, saw 127391 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-21 21:37:15] [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 1186 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-05-21 21:37:16] [INFO ] Deduced a trap composed of 13 places in 36 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 1059 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 2251ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 180 ms.
Support contains 1 out of 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 19 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 20 ms. Remains : 558/558 places, 1381/1381 transitions.
RANDOM walk for 40000 steps (679 resets) in 485 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 160972 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 160972 steps, saw 104253 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-21 21:37:21] [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 1165 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-05-21 21:37:22] [INFO ] Deduced a trap composed of 13 places in 38 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 1057 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 2228ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 184 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 24 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 24 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 26 ms. Remains 558 /558 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
[2024-05-21 21:37:23] [INFO ] Invariant cache hit.
[2024-05-21 21:37:24] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-21 21:37:24] [INFO ] Invariant cache hit.
[2024-05-21 21:37:26] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
[2024-05-21 21:37:26] [INFO ] Redundant transitions in 25 ms returned []
Running 1347 sub problems to find dead transitions.
[2024-05-21 21:37:26] [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 30032 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 30026 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 60900ms problems are : Problem set: 0 solved, 1347 unsolved
Search for dead transitions found 0 dead transitions in 60914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63653 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-05-21 21:38:27] [INFO ] Invariant cache hit.
[2024-05-21 21:38:27] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-21 21:38:27] [INFO ] [Real]Absence check using 14 positive and 43 generalized place invariants in 31 ms returned sat
[2024-05-21 21:38:28] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:38:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-21 21:38:28] [INFO ] [Nat]Absence check using 14 positive and 43 generalized place invariants in 28 ms returned sat
[2024-05-21 21:38:29] [INFO ] After 662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-21 21:38:29] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:38:29] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1906 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 150721 ms.
[2024-05-21 21:38:29] [INFO ] Flatten gal took : 257 ms
[2024-05-21 21:38:29] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 21:38:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 566 places, 1388 transitions and 5675 arcs took 16 ms.
Total runtime 1346977 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ASLink-PT-07a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 566
TRANSITIONS: 1388
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.042s, Sys 0.002s]
SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1312
MODEL NAME: /home/mcc/execution/417/model
566 places, 1388 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-07a-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-07a-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-07a-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-07a-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ASLink-PT-07a-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716327517490
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
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 r003-smll-171620117000109"
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 ;