About the Execution of ITS-Tools for ASLink-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8042.283 | 3600000.00 | 3219327.00 | 86259.10 | 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/mcc2021-input.r007-tall-162037989600165.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M May 5 16:51 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-10b-UpperBounds-00
FORMULA_NAME ASLink-PT-10b-UpperBounds-01
FORMULA_NAME ASLink-PT-10b-UpperBounds-02
FORMULA_NAME ASLink-PT-10b-UpperBounds-03
FORMULA_NAME ASLink-PT-10b-UpperBounds-04
FORMULA_NAME ASLink-PT-10b-UpperBounds-05
FORMULA_NAME ASLink-PT-10b-UpperBounds-06
FORMULA_NAME ASLink-PT-10b-UpperBounds-07
FORMULA_NAME ASLink-PT-10b-UpperBounds-08
FORMULA_NAME ASLink-PT-10b-UpperBounds-09
FORMULA_NAME ASLink-PT-10b-UpperBounds-10
FORMULA_NAME ASLink-PT-10b-UpperBounds-11
FORMULA_NAME ASLink-PT-10b-UpperBounds-12
FORMULA_NAME ASLink-PT-10b-UpperBounds-13
FORMULA_NAME ASLink-PT-10b-UpperBounds-14
FORMULA_NAME ASLink-PT-10b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620447741152
Running Version 0
[2021-05-08 04:22:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 04:22:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 04:22:22] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2021-05-08 04:22:23] [INFO ] Transformed 4410 places.
[2021-05-08 04:22:23] [INFO ] Transformed 5405 transitions.
[2021-05-08 04:22:23] [INFO ] Found NUPN structural information;
[2021-05-08 04:22:23] [INFO ] Parsed PT model containing 4410 places and 5405 transitions in 332 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 5405 rows 4410 cols
[2021-05-08 04:22:23] [INFO ] Computed 433 place invariants in 622 ms
Incomplete random walk after 10000 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 16) seen :4
FORMULA ASLink-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
// Phase 1: matrix 5405 rows 4410 cols
[2021-05-08 04:22:24] [INFO ] Computed 433 place invariants in 134 ms
[2021-05-08 04:22:25] [INFO ] [Real]Absence check using 102 positive place invariants in 118 ms returned sat
[2021-05-08 04:22:25] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 144 ms returned sat
[2021-05-08 04:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:29] [INFO ] [Real]Absence check using state equation in 3507 ms returned sat
[2021-05-08 04:22:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:22:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 104 ms returned sat
[2021-05-08 04:22:30] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 134 ms returned sat
[2021-05-08 04:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:34] [INFO ] [Nat]Absence check using state equation in 4183 ms returned unknown
[2021-05-08 04:22:35] [INFO ] [Real]Absence check using 102 positive place invariants in 102 ms returned sat
[2021-05-08 04:22:35] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 146 ms returned sat
[2021-05-08 04:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:39] [INFO ] [Real]Absence check using state equation in 4096 ms returned unknown
[2021-05-08 04:22:40] [INFO ] [Real]Absence check using 102 positive place invariants in 100 ms returned sat
[2021-05-08 04:22:40] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 153 ms returned sat
[2021-05-08 04:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:44] [INFO ] [Real]Absence check using state equation in 4023 ms returned sat
[2021-05-08 04:22:47] [INFO ] Deduced a trap composed of 19 places in 3289 ms of which 20 ms to minimize.
[2021-05-08 04:22:47] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-08 04:22:48] [INFO ] [Real]Absence check using 102 positive place invariants in 102 ms returned sat
[2021-05-08 04:22:48] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 150 ms returned sat
[2021-05-08 04:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:52] [INFO ] [Real]Absence check using state equation in 4244 ms returned unknown
[2021-05-08 04:22:53] [INFO ] [Real]Absence check using 102 positive place invariants in 101 ms returned sat
[2021-05-08 04:22:53] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 142 ms returned sat
[2021-05-08 04:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:22:57] [INFO ] [Real]Absence check using state equation in 3672 ms returned sat
[2021-05-08 04:22:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:22:58] [INFO ] [Nat]Absence check using 102 positive place invariants in 106 ms returned sat
[2021-05-08 04:22:58] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 137 ms returned sat
[2021-05-08 04:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:02] [INFO ] [Nat]Absence check using state equation in 4087 ms returned unknown
[2021-05-08 04:23:03] [INFO ] [Real]Absence check using 102 positive place invariants in 107 ms returned sat
[2021-05-08 04:23:03] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2021-05-08 04:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:06] [INFO ] [Real]Absence check using state equation in 3566 ms returned sat
[2021-05-08 04:23:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:23:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 102 ms returned sat
[2021-05-08 04:23:07] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 137 ms returned sat
[2021-05-08 04:23:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:12] [INFO ] [Nat]Absence check using state equation in 4221 ms returned unknown
[2021-05-08 04:23:12] [INFO ] [Real]Absence check using 102 positive place invariants in 100 ms returned sat
[2021-05-08 04:23:13] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2021-05-08 04:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:17] [INFO ] [Real]Absence check using state equation in 4115 ms returned unknown
[2021-05-08 04:23:17] [INFO ] [Real]Absence check using 102 positive place invariants in 101 ms returned sat
[2021-05-08 04:23:18] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 143 ms returned sat
[2021-05-08 04:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:21] [INFO ] [Real]Absence check using state equation in 3041 ms returned sat
[2021-05-08 04:23:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:23:22] [INFO ] [Nat]Absence check using 102 positive place invariants in 103 ms returned sat
[2021-05-08 04:23:22] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 141 ms returned sat
[2021-05-08 04:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:26] [INFO ] [Nat]Absence check using state equation in 4094 ms returned unknown
[2021-05-08 04:23:27] [INFO ] [Real]Absence check using 102 positive place invariants in 100 ms returned sat
[2021-05-08 04:23:27] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 149 ms returned sat
[2021-05-08 04:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:31] [INFO ] [Real]Absence check using state equation in 4115 ms returned unknown
[2021-05-08 04:23:32] [INFO ] [Real]Absence check using 102 positive place invariants in 102 ms returned sat
[2021-05-08 04:23:32] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 145 ms returned sat
[2021-05-08 04:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:35] [INFO ] [Real]Absence check using state equation in 3568 ms returned sat
[2021-05-08 04:23:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:23:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 104 ms returned sat
[2021-05-08 04:23:36] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2021-05-08 04:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:41] [INFO ] [Nat]Absence check using state equation in 4140 ms returned unknown
[2021-05-08 04:23:41] [INFO ] [Real]Absence check using 102 positive place invariants in 118 ms returned sat
[2021-05-08 04:23:42] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 147 ms returned sat
[2021-05-08 04:23:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:45] [INFO ] [Real]Absence check using state equation in 3495 ms returned sat
[2021-05-08 04:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:23:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 104 ms returned sat
[2021-05-08 04:23:46] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 136 ms returned sat
[2021-05-08 04:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:50] [INFO ] [Nat]Absence check using state equation in 4079 ms returned unknown
[2021-05-08 04:23:51] [INFO ] [Real]Absence check using 102 positive place invariants in 100 ms returned sat
[2021-05-08 04:23:51] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 150 ms returned sat
[2021-05-08 04:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:23:55] [INFO ] [Real]Absence check using state equation in 3713 ms returned sat
[2021-05-08 04:23:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:23:56] [INFO ] [Nat]Absence check using 102 positive place invariants in 105 ms returned sat
[2021-05-08 04:23:56] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2021-05-08 04:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:24:00] [INFO ] [Nat]Absence check using state equation in 4197 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 4410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions removed 1030 transitions
Trivial Post-agglo rules discarded 1030 transitions
Performed 1030 trivial Post agglomeration. Transition count delta: 1030
Iterating post reduction 0 with 1030 rules applied. Total rules applied 1030 place count 4410 transition count 4375
Reduce places removed 1030 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1076 rules applied. Total rules applied 2106 place count 3380 transition count 4329
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 2120 place count 3368 transition count 4327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2122 place count 3366 transition count 4327
Performed 1020 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1020 Pre rules applied. Total rules applied 2122 place count 3366 transition count 3307
Deduced a syphon composed of 1020 places in 29 ms
Ensure Unique test removed 102 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 4 with 2142 rules applied. Total rules applied 4264 place count 2244 transition count 3307
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 74 rules applied. Total rules applied 4338 place count 2233 transition count 3244
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 64 rules applied. Total rules applied 4402 place count 2170 transition count 3243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4403 place count 2169 transition count 3243
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 4403 place count 2169 transition count 3203
Deduced a syphon composed of 40 places in 10 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 4523 place count 2089 transition count 3203
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 4523 place count 2089 transition count 3163
Deduced a syphon composed of 40 places in 32 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4603 place count 2049 transition count 3163
Discarding 142 places :
Symmetric choice reduction at 7 with 142 rule applications. Total rules 4745 place count 1907 transition count 3021
Iterating global reduction 7 with 142 rules applied. Total rules applied 4887 place count 1907 transition count 3021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4888 place count 1907 transition count 3020
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 46 Pre rules applied. Total rules applied 4888 place count 1907 transition count 2974
Deduced a syphon composed of 46 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 8 with 93 rules applied. Total rules applied 4981 place count 1860 transition count 2974
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4981 place count 1860 transition count 2973
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4984 place count 1858 transition count 2973
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 4995 place count 1847 transition count 2904
Iterating global reduction 8 with 11 rules applied. Total rules applied 5006 place count 1847 transition count 2904
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 5006 place count 1847 transition count 2894
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 5026 place count 1837 transition count 2894
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5027 place count 1836 transition count 2886
Iterating global reduction 8 with 1 rules applied. Total rules applied 5028 place count 1836 transition count 2886
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5029 place count 1835 transition count 2878
Iterating global reduction 8 with 1 rules applied. Total rules applied 5030 place count 1835 transition count 2878
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5031 place count 1834 transition count 2870
Iterating global reduction 8 with 1 rules applied. Total rules applied 5032 place count 1834 transition count 2870
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5033 place count 1833 transition count 2862
Iterating global reduction 8 with 1 rules applied. Total rules applied 5034 place count 1833 transition count 2862
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5035 place count 1832 transition count 2854
Iterating global reduction 8 with 1 rules applied. Total rules applied 5036 place count 1832 transition count 2854
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5037 place count 1831 transition count 2846
Iterating global reduction 8 with 1 rules applied. Total rules applied 5038 place count 1831 transition count 2846
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5039 place count 1830 transition count 2838
Iterating global reduction 8 with 1 rules applied. Total rules applied 5040 place count 1830 transition count 2838
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5041 place count 1829 transition count 2830
Iterating global reduction 8 with 1 rules applied. Total rules applied 5042 place count 1829 transition count 2830
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5043 place count 1828 transition count 2822
Iterating global reduction 8 with 1 rules applied. Total rules applied 5044 place count 1828 transition count 2822
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5045 place count 1827 transition count 2814
Iterating global reduction 8 with 1 rules applied. Total rules applied 5046 place count 1827 transition count 2814
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5047 place count 1826 transition count 2806
Iterating global reduction 8 with 1 rules applied. Total rules applied 5048 place count 1826 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5049 place count 1825 transition count 2798
Iterating global reduction 8 with 1 rules applied. Total rules applied 5050 place count 1825 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5051 place count 1824 transition count 2790
Iterating global reduction 8 with 1 rules applied. Total rules applied 5052 place count 1824 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5053 place count 1823 transition count 2782
Iterating global reduction 8 with 1 rules applied. Total rules applied 5054 place count 1823 transition count 2782
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5055 place count 1822 transition count 2774
Iterating global reduction 8 with 1 rules applied. Total rules applied 5056 place count 1822 transition count 2774
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5057 place count 1821 transition count 2766
Iterating global reduction 8 with 1 rules applied. Total rules applied 5058 place count 1821 transition count 2766
Performed 257 Post agglomeration using F-continuation condition.Transition count delta: 257
Deduced a syphon composed of 257 places in 6 ms
Reduce places removed 257 places and 0 transitions.
Iterating global reduction 8 with 514 rules applied. Total rules applied 5572 place count 1564 transition count 2509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5573 place count 1563 transition count 2508
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 5575 place count 1562 transition count 2508
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5576 place count 1561 transition count 2507
Iterating global reduction 8 with 1 rules applied. Total rules applied 5577 place count 1561 transition count 2507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 5579 place count 1561 transition count 2505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5580 place count 1560 transition count 2505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5582 place count 1559 transition count 2514
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 5593 place count 1559 transition count 2503
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 5604 place count 1548 transition count 2503
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 5613 place count 1548 transition count 2494
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 5622 place count 1539 transition count 2494
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 5623 place count 1538 transition count 2493
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 12 with 28 rules applied. Total rules applied 5651 place count 1519 transition count 2484
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 5660 place count 1510 transition count 2484
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 28 Pre rules applied. Total rules applied 5660 place count 1510 transition count 2456
Deduced a syphon composed of 28 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 14 with 57 rules applied. Total rules applied 5717 place count 1481 transition count 2456
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 5728 place count 1470 transition count 2456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 5728 place count 1470 transition count 2455
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5730 place count 1469 transition count 2455
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 15 with 40 rules applied. Total rules applied 5770 place count 1449 transition count 2435
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 5779 place count 1440 transition count 2426
Iterating global reduction 15 with 9 rules applied. Total rules applied 5788 place count 1440 transition count 2426
Free-agglomeration rule applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 5798 place count 1440 transition count 2416
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 5808 place count 1430 transition count 2416
Applied a total of 5808 rules in 3653 ms. Remains 1430 /4410 variables (removed 2980) and now considering 2416/5405 (removed 2989) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/4410 places, 2416/5405 transitions.
// Phase 1: matrix 2416 rows 1430 cols
[2021-05-08 04:24:04] [INFO ] Computed 246 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 9243 resets, run finished after 5378 ms. (steps per millisecond=185 ) properties (out of 12) seen :5
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 903 resets, run finished after 1811 ms. (steps per millisecond=552 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 908 resets, run finished after 1820 ms. (steps per millisecond=549 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 910 resets, run finished after 1835 ms. (steps per millisecond=544 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 911 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 916 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 914 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 908 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties (out of 7) seen :0
// Phase 1: matrix 2416 rows 1430 cols
[2021-05-08 04:24:22] [INFO ] Computed 246 place invariants in 46 ms
[2021-05-08 04:24:22] [INFO ] [Real]Absence check using 68 positive place invariants in 28 ms returned sat
[2021-05-08 04:24:22] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:24:23] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2021-05-08 04:24:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:24:23] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:24:23] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:24:25] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2021-05-08 04:24:25] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 172 ms.
[2021-05-08 04:24:38] [INFO ] Added : 579 causal constraints over 116 iterations in 13458 ms. Result :sat
Minimization took 530 ms.
[2021-05-08 04:24:39] [INFO ] [Real]Absence check using 68 positive place invariants in 26 ms returned sat
[2021-05-08 04:24:39] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:24:40] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2021-05-08 04:24:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:24:40] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:24:40] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 37 ms returned sat
[2021-05-08 04:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:24:41] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2021-05-08 04:24:42] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 148 ms.
[2021-05-08 04:25:01] [INFO ] Added : 752 causal constraints over 151 iterations in 19743 ms. Result :sat
Minimization took 1664 ms.
[2021-05-08 04:25:03] [INFO ] [Real]Absence check using 68 positive place invariants in 26 ms returned sat
[2021-05-08 04:25:03] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 39 ms returned sat
[2021-05-08 04:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:04] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2021-05-08 04:25:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:25:04] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:25:04] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:05] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2021-05-08 04:25:05] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 127 ms.
[2021-05-08 04:25:21] [INFO ] Added : 563 causal constraints over 113 iterations in 16001 ms. Result :sat
Minimization took 1641 ms.
[2021-05-08 04:25:23] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:25:23] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:24] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2021-05-08 04:25:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:25:24] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:25:24] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 37 ms returned sat
[2021-05-08 04:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:25] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2021-05-08 04:25:26] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 147 ms.
[2021-05-08 04:25:45] [INFO ] Added : 773 causal constraints over 155 iterations in 20056 ms.(timeout) Result :sat
Minimization took 1820 ms.
[2021-05-08 04:25:48] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:25:48] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:48] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-08 04:25:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:25:49] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:25:49] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 35 ms returned sat
[2021-05-08 04:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:51] [INFO ] [Nat]Absence check using state equation in 2035 ms returned sat
[2021-05-08 04:25:51] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 122 ms.
[2021-05-08 04:25:56] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 2 ms to minimize.
[2021-05-08 04:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2021-05-08 04:25:57] [INFO ] Added : 191 causal constraints over 39 iterations in 5781 ms. Result :sat
Minimization took 1002 ms.
[2021-05-08 04:25:58] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:25:58] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:25:59] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2021-05-08 04:25:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:25:59] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:25:59] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 37 ms returned sat
[2021-05-08 04:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:26:00] [INFO ] [Nat]Absence check using state equation in 1305 ms returned sat
[2021-05-08 04:26:00] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 163 ms.
[2021-05-08 04:26:20] [INFO ] Added : 745 causal constraints over 149 iterations in 20037 ms.(timeout) Result :sat
Minimization took 1292 ms.
[2021-05-08 04:26:22] [INFO ] [Real]Absence check using 68 positive place invariants in 20 ms returned sat
[2021-05-08 04:26:22] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:26:23] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2021-05-08 04:26:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:26:23] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:26:23] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:26:24] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2021-05-08 04:26:24] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2021-05-08 04:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2021-05-08 04:26:24] [INFO ] Computed and/alt/rep : 987/3852/987 causal constraints (skipped 1380 transitions) in 147 ms.
[2021-05-08 04:26:44] [INFO ] Added : 768 causal constraints over 154 iterations in 19301 ms. Result :sat
Minimization took 1507 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 267200 steps, including 2874 resets, run finished after 1463 ms. (steps per millisecond=182 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1011400 steps, including 6993 resets, run finished after 5292 ms. (steps per millisecond=191 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 756300 steps, including 10855 resets, run finished after 3805 ms. (steps per millisecond=198 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1250700 steps, including 10698 resets, run finished after 6600 ms. (steps per millisecond=189 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 310200 steps, including 2653 resets, run finished after 1484 ms. (steps per millisecond=209 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1319400 steps, including 10161 resets, run finished after 6764 ms. (steps per millisecond=195 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 779300 steps, including 5852 resets, run finished after 4121 ms. (steps per millisecond=189 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 1430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1430/1430 places, 2416/2416 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1430 transition count 2415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1429 transition count 2415
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1429 transition count 2412
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1426 transition count 2412
Applied a total of 8 rules in 96 ms. Remains 1426 /1430 variables (removed 4) and now considering 2412/2416 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 1426/1430 places, 2412/2416 transitions.
// Phase 1: matrix 2412 rows 1426 cols
[2021-05-08 04:27:15] [INFO ] Computed 246 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 9417 resets, run finished after 5095 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 903 resets, run finished after 1795 ms. (steps per millisecond=557 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 904 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 908 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 905 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 902 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 908 resets, run finished after 1798 ms. (steps per millisecond=556 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 912 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 7) seen :0
// Phase 1: matrix 2412 rows 1426 cols
[2021-05-08 04:27:33] [INFO ] Computed 246 place invariants in 46 ms
[2021-05-08 04:27:33] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:27:33] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 43 ms returned sat
[2021-05-08 04:27:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:27:34] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2021-05-08 04:27:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:27:34] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:27:34] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 40 ms returned sat
[2021-05-08 04:27:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:27:35] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2021-05-08 04:27:35] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 138 ms.
[2021-05-08 04:27:54] [INFO ] Added : 746 causal constraints over 150 iterations in 19033 ms. Result :sat
Minimization took 1253 ms.
[2021-05-08 04:27:56] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:27:56] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 37 ms returned sat
[2021-05-08 04:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:27:57] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2021-05-08 04:27:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:27:57] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:27:57] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 37 ms returned sat
[2021-05-08 04:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:27:58] [INFO ] [Nat]Absence check using state equation in 1125 ms returned sat
[2021-05-08 04:27:58] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 148 ms.
[2021-05-08 04:28:17] [INFO ] Added : 751 causal constraints over 151 iterations in 18955 ms. Result :sat
Minimization took 1965 ms.
[2021-05-08 04:28:19] [INFO ] [Real]Absence check using 68 positive place invariants in 20 ms returned sat
[2021-05-08 04:28:19] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:28:20] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2021-05-08 04:28:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:28:20] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:28:20] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:28:21] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2021-05-08 04:28:22] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 119 ms.
[2021-05-08 04:28:41] [INFO ] Added : 790 causal constraints over 158 iterations in 19989 ms. Result :sat
Minimization took 1424 ms.
[2021-05-08 04:28:43] [INFO ] [Real]Absence check using 68 positive place invariants in 20 ms returned sat
[2021-05-08 04:28:43] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 41 ms returned sat
[2021-05-08 04:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:28:44] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2021-05-08 04:28:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:28:44] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:28:44] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:28:45] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2021-05-08 04:28:45] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 120 ms.
[2021-05-08 04:29:03] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2021-05-08 04:29:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2021-05-08 04:29:03] [INFO ] Added : 715 causal constraints over 143 iterations in 17895 ms. Result :sat
Minimization took 1334 ms.
[2021-05-08 04:29:05] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:29:05] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 41 ms returned sat
[2021-05-08 04:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:05] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2021-05-08 04:29:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:29:06] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:29:06] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 43 ms returned sat
[2021-05-08 04:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:07] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2021-05-08 04:29:07] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 6 ms to minimize.
[2021-05-08 04:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2021-05-08 04:29:08] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 162 ms.
[2021-05-08 04:29:25] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2021-05-08 04:29:25] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 1 ms to minimize.
[2021-05-08 04:29:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2021-05-08 04:29:26] [INFO ] Added : 697 causal constraints over 140 iterations in 18113 ms. Result :sat
Minimization took 1187 ms.
[2021-05-08 04:29:27] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:29:27] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:28] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2021-05-08 04:29:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:29:28] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:29:28] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:29:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:29] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2021-05-08 04:29:29] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 146 ms.
[2021-05-08 04:29:49] [INFO ] Added : 765 causal constraints over 153 iterations in 20144 ms.(timeout) Result :sat
Minimization took 1487 ms.
[2021-05-08 04:29:51] [INFO ] [Real]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:29:51] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 41 ms returned sat
[2021-05-08 04:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:52] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2021-05-08 04:29:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:29:52] [INFO ] [Nat]Absence check using 68 positive place invariants in 23 ms returned sat
[2021-05-08 04:29:52] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 45 ms returned sat
[2021-05-08 04:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:29:54] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2021-05-08 04:29:54] [INFO ] Computed and/alt/rep : 975/3769/975 causal constraints (skipped 1388 transitions) in 127 ms.
[2021-05-08 04:30:09] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2021-05-08 04:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2021-05-08 04:30:09] [INFO ] Added : 494 causal constraints over 99 iterations in 15805 ms. Result :sat
Minimization took 1194 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 457600 steps, including 5525 resets, run finished after 2352 ms. (steps per millisecond=194 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 795700 steps, including 7503 resets, run finished after 4235 ms. (steps per millisecond=187 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 533300 steps, including 1002 resets, run finished after 2392 ms. (steps per millisecond=222 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 350600 steps, including 3606 resets, run finished after 1762 ms. (steps per millisecond=198 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 454000 steps, including 1002 resets, run finished after 2079 ms. (steps per millisecond=218 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4935600 steps, including 52198 resets, run finished after 28308 ms. (steps per millisecond=174 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 766400 steps, including 6021 resets, run finished after 3954 ms. (steps per millisecond=193 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 1426 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1426/1426 places, 2412/2412 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1426 transition count 2411
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1425 transition count 2411
Applied a total of 2 rules in 79 ms. Remains 1425 /1426 variables (removed 1) and now considering 2411/2412 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1425/1426 places, 2411/2412 transitions.
// Phase 1: matrix 2411 rows 1425 cols
[2021-05-08 04:30:56] [INFO ] Computed 246 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 9260 resets, run finished after 5046 ms. (steps per millisecond=198 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 903 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 900 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 912 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 903 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 911 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 907 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 6) seen :0
// Phase 1: matrix 2411 rows 1425 cols
[2021-05-08 04:31:12] [INFO ] Computed 246 place invariants in 57 ms
[2021-05-08 04:31:12] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:31:12] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:31:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:13] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2021-05-08 04:31:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:31:13] [INFO ] [Nat]Absence check using 68 positive place invariants in 23 ms returned sat
[2021-05-08 04:31:13] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:15] [INFO ] [Nat]Absence check using state equation in 1556 ms returned sat
[2021-05-08 04:31:15] [INFO ] Deduced a trap composed of 131 places in 450 ms of which 1 ms to minimize.
[2021-05-08 04:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 590 ms
[2021-05-08 04:31:15] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 142 ms.
[2021-05-08 04:31:36] [INFO ] Added : 795 causal constraints over 159 iterations in 20308 ms.(timeout) Result :sat
Minimization took 1190 ms.
[2021-05-08 04:31:37] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:31:37] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:38] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2021-05-08 04:31:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:31:38] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:31:38] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:40] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2021-05-08 04:31:40] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 120 ms.
[2021-05-08 04:31:45] [INFO ] Added : 207 causal constraints over 42 iterations in 5580 ms. Result :sat
Minimization took 1640 ms.
[2021-05-08 04:31:47] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:31:47] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:48] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2021-05-08 04:31:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:31:48] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:31:48] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:31:49] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2021-05-08 04:31:49] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 166 ms.
[2021-05-08 04:32:09] [INFO ] Added : 732 causal constraints over 147 iterations in 19328 ms. Result :sat
Minimization took 1453 ms.
[2021-05-08 04:32:10] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:32:10] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 44 ms returned sat
[2021-05-08 04:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:11] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2021-05-08 04:32:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:32:11] [INFO ] [Nat]Absence check using 68 positive place invariants in 22 ms returned sat
[2021-05-08 04:32:11] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 44 ms returned sat
[2021-05-08 04:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:12] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2021-05-08 04:32:13] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 146 ms.
[2021-05-08 04:32:19] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2021-05-08 04:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2021-05-08 04:32:20] [INFO ] Added : 261 causal constraints over 53 iterations in 7349 ms. Result :sat
Minimization took 1508 ms.
[2021-05-08 04:32:22] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:32:22] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 38 ms returned sat
[2021-05-08 04:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:22] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2021-05-08 04:32:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:32:23] [INFO ] [Nat]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:32:23] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:23] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2021-05-08 04:32:24] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 123 ms.
[2021-05-08 04:32:43] [INFO ] Added : 782 causal constraints over 157 iterations in 19849 ms. Result :sat
Minimization took 1163 ms.
[2021-05-08 04:32:45] [INFO ] [Real]Absence check using 68 positive place invariants in 21 ms returned sat
[2021-05-08 04:32:45] [INFO ] [Real]Absence check using 68 positive and 178 generalized place invariants in 36 ms returned sat
[2021-05-08 04:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:46] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2021-05-08 04:32:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:32:46] [INFO ] [Nat]Absence check using 68 positive place invariants in 23 ms returned sat
[2021-05-08 04:32:46] [INFO ] [Nat]Absence check using 68 positive and 178 generalized place invariants in 41 ms returned sat
[2021-05-08 04:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:32:47] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2021-05-08 04:32:48] [INFO ] Computed and/alt/rep : 974/3768/974 causal constraints (skipped 1388 transitions) in 125 ms.
[2021-05-08 04:32:55] [INFO ] Added : 238 causal constraints over 48 iterations in 7826 ms. Result :sat
Minimization took 1490 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 508700 steps, including 3955 resets, run finished after 2519 ms. (steps per millisecond=201 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 448500 steps, including 1002 resets, run finished after 1972 ms. (steps per millisecond=227 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 426900 steps, including 5277 resets, run finished after 2071 ms. (steps per millisecond=206 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 459900 steps, including 1002 resets, run finished after 1981 ms. (steps per millisecond=232 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 242500 steps, including 3152 resets, run finished after 1166 ms. (steps per millisecond=207 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 837800 steps, including 5110 resets, run finished after 4203 ms. (steps per millisecond=199 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 1425 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1425/1425 places, 2411/2411 transitions.
Applied a total of 0 rules in 59 ms. Remains 1425 /1425 variables (removed 0) and now considering 2411/2411 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1425/1425 places, 2411/2411 transitions.
Starting structural reductions, iteration 0 : 1425/1425 places, 2411/2411 transitions.
Applied a total of 0 rules in 58 ms. Remains 1425 /1425 variables (removed 0) and now considering 2411/2411 (removed 0) transitions.
// Phase 1: matrix 2411 rows 1425 cols
[2021-05-08 04:33:11] [INFO ] Computed 246 place invariants in 43 ms
[2021-05-08 04:33:12] [INFO ] Implicit Places using invariants in 1010 ms returned [1, 18, 19, 31, 49, 67, 139, 143, 152, 153, 155, 172, 190, 260, 264, 265, 276, 277, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 631, 635, 636, 647, 648, 650, 667, 685, 754, 758, 759, 770, 771, 773, 790, 808, 877, 881, 882, 893, 894, 896, 913, 931, 1007, 1021, 1022, 1024, 1041, 1059, 1128, 1132, 1133, 1144, 1145, 1147, 1164, 1182, 1251, 1255, 1256, 1259, 1270, 1271, 1272, 1290, 1292, 1296, 1314, 1315, 1316, 1317, 1329, 1335, 1341, 1347, 1353, 1359, 1365, 1371, 1377, 1383, 1389]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 99 implicit places.
[2021-05-08 04:33:12] [INFO ] Redundant transitions in 172 ms returned []
// Phase 1: matrix 2411 rows 1326 cols
[2021-05-08 04:33:12] [INFO ] Computed 147 place invariants in 27 ms
[2021-05-08 04:33:13] [INFO ] Dead Transitions using invariants and state equation in 1077 ms returned []
Starting structural reductions, iteration 1 : 1326/1425 places, 2411/2411 transitions.
Drop transitions removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 182 place count 1326 transition count 2229
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 189 rules applied. Total rules applied 371 place count 1144 transition count 2222
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 371 place count 1144 transition count 2175
Deduced a syphon composed of 47 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 466 place count 1096 transition count 2175
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 478 place count 1092 transition count 2167
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 486 place count 1084 transition count 2167
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 502 place count 1068 transition count 2151
Iterating global reduction 4 with 16 rules applied. Total rules applied 518 place count 1068 transition count 2151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 521 place count 1068 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 521 place count 1068 transition count 2147
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 523 place count 1067 transition count 2147
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 527 place count 1063 transition count 2140
Iterating global reduction 5 with 4 rules applied. Total rules applied 531 place count 1063 transition count 2140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 533 place count 1061 transition count 2138
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 1061 transition count 2138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 536 place count 1061 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 537 place count 1060 transition count 2135
Iterating global reduction 6 with 1 rules applied. Total rules applied 538 place count 1060 transition count 2135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 682 place count 988 transition count 2063
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 690 place count 980 transition count 2055
Iterating global reduction 6 with 8 rules applied. Total rules applied 698 place count 980 transition count 2055
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 706 place count 980 transition count 2047
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 710 place count 978 transition count 2048
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 711 place count 978 transition count 2047
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 733 place count 978 transition count 2025
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 756 place count 955 transition count 2025
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 786 place count 955 transition count 2025
Applied a total of 786 rules in 517 ms. Remains 955 /1326 variables (removed 371) and now considering 2025/2411 (removed 386) transitions.
// Phase 1: matrix 2025 rows 955 cols
[2021-05-08 04:33:14] [INFO ] Computed 141 place invariants in 24 ms
[2021-05-08 04:33:14] [INFO ] Implicit Places using invariants in 720 ms returned [74, 91, 97, 100, 102, 106, 107, 160, 177, 183, 186, 188, 193, 194, 249, 270, 276, 279, 281, 286, 287, 339, 356, 362, 365, 367, 372, 373, 425, 443, 449, 452, 454, 459, 460, 512, 529, 535, 538, 540, 545, 546, 598, 615, 621, 624, 626, 631, 632, 702, 708, 711, 713, 716, 723, 724, 777, 794, 800, 803, 805, 810, 811, 863, 880, 886, 889, 891]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 722 ms to find 68 implicit places.
Starting structural reductions, iteration 2 : 887/1425 places, 2025/2411 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 856 transition count 1994
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 856 transition count 1994
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 847 transition count 1985
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 847 transition count 1985
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 116 place count 829 transition count 1967
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 829 transition count 1966
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 147 place count 829 transition count 1936
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 177 place count 799 transition count 1936
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 185 place count 799 transition count 1928
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 193 place count 791 transition count 1928
Applied a total of 193 rules in 247 ms. Remains 791 /887 variables (removed 96) and now considering 1928/2025 (removed 97) transitions.
// Phase 1: matrix 1928 rows 791 cols
[2021-05-08 04:33:15] [INFO ] Computed 73 place invariants in 19 ms
[2021-05-08 04:33:15] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 1928 rows 791 cols
[2021-05-08 04:33:15] [INFO ] Computed 73 place invariants in 19 ms
[2021-05-08 04:33:17] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 791/1425 places, 1928/2411 transitions.
Successfully produced net in file /tmp/petri1000_1044204842796526790.dot
Successfully produced net in file /tmp/petri1001_1333211916373917283.dot
Successfully produced net in file /tmp/petri1002_14162718585531295759.dot
Successfully produced net in file /tmp/petri1003_2476800094556348500.dot
Successfully produced net in file /tmp/petri1004_341479154606600562.dot
Successfully produced net in file /tmp/petri1005_5515922722175148327.dot
Successfully produced net in file /tmp/petri1006_1614311370387617920.dot
Successfully produced net in file /tmp/petri1007_15520471631608568590.dot
Successfully produced net in file /tmp/petri1008_10619339742693921913.dot
Successfully produced net in file /tmp/petri1009_2044084560452163715.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1918 rows 791 cols
[2021-05-08 04:33:17] [INFO ] Computed 73 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 15539 resets, run finished after 3923 ms. (steps per millisecond=254 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2034 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2044 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2049 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2068 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2055 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2034 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 6) seen :0
// Phase 1: matrix 1918 rows 791 cols
[2021-05-08 04:33:27] [INFO ] Computed 73 place invariants in 20 ms
[2021-05-08 04:33:28] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:28] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 15 ms returned sat
[2021-05-08 04:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:28] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2021-05-08 04:33:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:28] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 13 ms returned sat
[2021-05-08 04:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:29] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2021-05-08 04:33:29] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 99 ms.
[2021-05-08 04:33:30] [INFO ] Added : 59 causal constraints over 12 iterations in 1030 ms. Result :sat
Minimization took 297 ms.
[2021-05-08 04:33:30] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:30] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 14 ms returned sat
[2021-05-08 04:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:31] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2021-05-08 04:33:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:31] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:31] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 15 ms returned sat
[2021-05-08 04:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:32] [INFO ] [Nat]Absence check using state equation in 1025 ms returned sat
[2021-05-08 04:33:32] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 110 ms.
[2021-05-08 04:33:35] [INFO ] Added : 64 causal constraints over 13 iterations in 2346 ms. Result :sat
Minimization took 450 ms.
[2021-05-08 04:33:35] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:35] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 14 ms returned sat
[2021-05-08 04:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:36] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-08 04:33:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:36] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 14 ms returned sat
[2021-05-08 04:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:37] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2021-05-08 04:33:37] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 102 ms.
[2021-05-08 04:33:39] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2021-05-08 04:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2021-05-08 04:33:40] [INFO ] Added : 73 causal constraints over 16 iterations in 2653 ms. Result :sat
Minimization took 498 ms.
[2021-05-08 04:33:40] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:40] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 13 ms returned sat
[2021-05-08 04:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:41] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-08 04:33:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:41] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 13 ms returned sat
[2021-05-08 04:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:42] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2021-05-08 04:33:42] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 100 ms.
[2021-05-08 04:33:43] [INFO ] Added : 26 causal constraints over 6 iterations in 660 ms. Result :sat
Minimization took 266 ms.
[2021-05-08 04:33:43] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2021-05-08 04:33:43] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 17 ms returned sat
[2021-05-08 04:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:43] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-05-08 04:33:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:44] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 14 ms returned sat
[2021-05-08 04:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:44] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2021-05-08 04:33:44] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 114 ms.
[2021-05-08 04:33:46] [INFO ] Added : 53 causal constraints over 12 iterations in 2017 ms. Result :sat
Minimization took 293 ms.
[2021-05-08 04:33:47] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:47] [INFO ] [Real]Absence check using 18 positive and 55 generalized place invariants in 15 ms returned sat
[2021-05-08 04:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:47] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2021-05-08 04:33:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:33:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2021-05-08 04:33:47] [INFO ] [Nat]Absence check using 18 positive and 55 generalized place invariants in 14 ms returned sat
[2021-05-08 04:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:33:49] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2021-05-08 04:33:49] [INFO ] Computed and/alt/rep : 487/2214/487 causal constraints (skipped 1382 transitions) in 113 ms.
[2021-05-08 04:33:51] [INFO ] Added : 85 causal constraints over 18 iterations in 1996 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 242300 steps, including 2958 resets, run finished after 968 ms. (steps per millisecond=250 ) properties (out of 6) seen :4 could not realise parikh vector
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 174100 steps, including 2874 resets, run finished after 655 ms. (steps per millisecond=265 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 179000 steps, including 2588 resets, run finished after 698 ms. (steps per millisecond=256 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 166500 steps, including 2498 resets, run finished after 616 ms. (steps per millisecond=270 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 224900 steps, including 4095 resets, run finished after 835 ms. (steps per millisecond=269 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 141600 steps, including 3264 resets, run finished after 558 ms. (steps per millisecond=253 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 791/791 places, 1918/1918 transitions.
Graph (complete) has 4754 edges and 791 vertex of which 781 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 781 transition count 1916
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 779 transition count 1916
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 776 transition count 1914
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 776 transition count 1913
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 11 place count 776 transition count 1911
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 774 transition count 1911
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 774 transition count 1911
Applied a total of 25 rules in 111 ms. Remains 774 /791 variables (removed 17) and now considering 1911/1918 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/791 places, 1911/1918 transitions.
// Phase 1: matrix 1911 rows 774 cols
[2021-05-08 04:33:56] [INFO ] Computed 72 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16089 resets, run finished after 3878 ms. (steps per millisecond=257 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2126 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2118 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 2) seen :0
// Phase 1: matrix 1911 rows 774 cols
[2021-05-08 04:34:02] [INFO ] Computed 72 place invariants in 23 ms
[2021-05-08 04:34:02] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:02] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 15 ms returned sat
[2021-05-08 04:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:03] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2021-05-08 04:34:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:03] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:04] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2021-05-08 04:34:04] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2021-05-08 04:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2021-05-08 04:34:04] [INFO ] Computed and/alt/rep : 450/2018/450 causal constraints (skipped 1412 transitions) in 98 ms.
[2021-05-08 04:34:06] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2021-05-08 04:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2021-05-08 04:34:06] [INFO ] Added : 87 causal constraints over 18 iterations in 2174 ms. Result :sat
Minimization took 518 ms.
[2021-05-08 04:34:07] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 04:34:07] [INFO ] [Real]Absence check using 16 positive and 56 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:07] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-08 04:34:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:07] [INFO ] [Nat]Absence check using 16 positive and 56 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:09] [INFO ] [Nat]Absence check using state equation in 1700 ms returned sat
[2021-05-08 04:34:09] [INFO ] Computed and/alt/rep : 450/2018/450 causal constraints (skipped 1412 transitions) in 115 ms.
[2021-05-08 04:34:11] [INFO ] Added : 82 causal constraints over 17 iterations in 2087 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 75600 steps, including 2005 resets, run finished after 372 ms. (steps per millisecond=203 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 131200 steps, including 1003 resets, run finished after 414 ms. (steps per millisecond=316 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 774/774 places, 1911/1911 transitions.
Applied a total of 0 rules in 33 ms. Remains 774 /774 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/774 places, 1911/1911 transitions.
Starting structural reductions, iteration 0 : 774/774 places, 1911/1911 transitions.
Applied a total of 0 rules in 33 ms. Remains 774 /774 variables (removed 0) and now considering 1911/1911 (removed 0) transitions.
// Phase 1: matrix 1911 rows 774 cols
[2021-05-08 04:34:12] [INFO ] Computed 72 place invariants in 19 ms
[2021-05-08 04:34:13] [INFO ] Implicit Places using invariants in 471 ms returned [158, 573, 574]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 473 ms to find 3 implicit places.
[2021-05-08 04:34:13] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 1911 rows 771 cols
[2021-05-08 04:34:13] [INFO ] Computed 69 place invariants in 20 ms
[2021-05-08 04:34:14] [INFO ] Dead Transitions using invariants and state equation in 879 ms returned []
Starting structural reductions, iteration 1 : 771/774 places, 1911/1911 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 771 transition count 1907
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 767 transition count 1907
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 765 transition count 1905
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 765 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 763 transition count 1903
Applied a total of 16 rules in 103 ms. Remains 763 /771 variables (removed 8) and now considering 1903/1911 (removed 8) transitions.
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:14] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:14] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:14] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:16] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 763/774 places, 1903/1911 transitions.
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:16] [INFO ] Computed 69 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16050 resets, run finished after 3887 ms. (steps per millisecond=257 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2142 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2131 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 2) seen :0
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:22] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:34:22] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:22] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 19 ms returned sat
[2021-05-08 04:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:23] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-08 04:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 04:34:23] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:23] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2021-05-08 04:34:24] [INFO ] Computed and/alt/rep : 445/1886/445 causal constraints (skipped 1409 transitions) in 101 ms.
[2021-05-08 04:34:25] [INFO ] Added : 69 causal constraints over 14 iterations in 1561 ms. Result :sat
Minimization took 203 ms.
[2021-05-08 04:34:25] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 04:34:25] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:26] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-08 04:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:26] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:27] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2021-05-08 04:34:27] [INFO ] Computed and/alt/rep : 445/1886/445 causal constraints (skipped 1409 transitions) in 112 ms.
[2021-05-08 04:34:28] [INFO ] Added : 34 causal constraints over 8 iterations in 997 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 170500 steps, including 4176 resets, run finished after 635 ms. (steps per millisecond=268 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 142300 steps, including 2254 resets, run finished after 515 ms. (steps per millisecond=276 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 1903/1903 transitions.
Applied a total of 0 rules in 34 ms. Remains 763 /763 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 1903/1903 transitions.
Starting structural reductions, iteration 0 : 763/763 places, 1903/1903 transitions.
Applied a total of 0 rules in 34 ms. Remains 763 /763 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:30] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:34:30] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:30] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:32] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2021-05-08 04:34:32] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:32] [INFO ] Computed 69 place invariants in 24 ms
[2021-05-08 04:34:33] [INFO ] Dead Transitions using invariants and state equation in 747 ms returned []
Finished structural reductions, in 1 iterations. Remains : 763/763 places, 1903/1903 transitions.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-02
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:33] [INFO ] Computed 69 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 151 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:33] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:34:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 04:34:33] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 15 ms returned sat
[2021-05-08 04:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:33] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2021-05-08 04:34:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:33] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 15 ms returned sat
[2021-05-08 04:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:34] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2021-05-08 04:34:34] [INFO ] Computed and/alt/rep : 445/1886/445 causal constraints (skipped 1409 transitions) in 116 ms.
[2021-05-08 04:34:36] [INFO ] Added : 69 causal constraints over 14 iterations in 1564 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 142300 steps, including 2254 resets, run finished after 585 ms. (steps per millisecond=243 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 1903/1903 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 762 transition count 1902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 761 transition count 1901
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 761 transition count 1900
Applied a total of 5 rules in 70 ms. Remains 761 /763 variables (removed 2) and now considering 1900/1903 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/763 places, 1900/1903 transitions.
// Phase 1: matrix 1900 rows 761 cols
[2021-05-08 04:34:37] [INFO ] Computed 69 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 16074 resets, run finished after 3675 ms. (steps per millisecond=272 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2124 resets, run finished after 1029 ms. (steps per millisecond=971 ) properties (out of 1) seen :0
// Phase 1: matrix 1900 rows 761 cols
[2021-05-08 04:34:41] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:41] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 04:34:41] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 13 ms returned sat
[2021-05-08 04:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:42] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2021-05-08 04:34:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:42] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 13 ms returned sat
[2021-05-08 04:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:43] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2021-05-08 04:34:43] [INFO ] Computed and/alt/rep : 442/1876/442 causal constraints (skipped 1409 transitions) in 97 ms.
[2021-05-08 04:34:44] [INFO ] Added : 49 causal constraints over 10 iterations in 1051 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 80100 steps, including 2333 resets, run finished after 320 ms. (steps per millisecond=250 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 761 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 761/761 places, 1900/1900 transitions.
Applied a total of 0 rules in 31 ms. Remains 761 /761 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 1900/1900 transitions.
Starting structural reductions, iteration 0 : 761/761 places, 1900/1900 transitions.
Applied a total of 0 rules in 32 ms. Remains 761 /761 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
// Phase 1: matrix 1900 rows 761 cols
[2021-05-08 04:34:44] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:45] [INFO ] Implicit Places using invariants in 472 ms returned []
// Phase 1: matrix 1900 rows 761 cols
[2021-05-08 04:34:45] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:34:47] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2021-05-08 04:34:47] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1900 rows 761 cols
[2021-05-08 04:34:47] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:47] [INFO ] Dead Transitions using invariants and state equation in 749 ms returned []
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 1900/1900 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-02 in 14818 ms.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-12
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:47] [INFO ] Computed 69 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 155 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 1903 rows 763 cols
[2021-05-08 04:34:47] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:34:48] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:48] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 16 ms returned sat
[2021-05-08 04:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:48] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2021-05-08 04:34:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:48] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 15 ms returned sat
[2021-05-08 04:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:49] [INFO ] [Nat]Absence check using state equation in 851 ms returned sat
[2021-05-08 04:34:49] [INFO ] Computed and/alt/rep : 445/1886/445 causal constraints (skipped 1409 transitions) in 99 ms.
[2021-05-08 04:34:50] [INFO ] Added : 34 causal constraints over 8 iterations in 994 ms. Result :sat
Minimization took 315 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 170500 steps, including 4133 resets, run finished after 622 ms. (steps per millisecond=274 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 763 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 763/763 places, 1903/1903 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 762 transition count 1902
Applied a total of 2 rules in 38 ms. Remains 762 /763 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/763 places, 1902/1903 transitions.
Successfully produced net in file /tmp/petri1010_4821835615842113822.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 1901 rows 762 cols
[2021-05-08 04:34:51] [INFO ] Computed 69 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16048 resets, run finished after 3638 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2118 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 1) seen :0
// Phase 1: matrix 1901 rows 762 cols
[2021-05-08 04:34:56] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:34:56] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:56] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 14 ms returned sat
[2021-05-08 04:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:57] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2021-05-08 04:34:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:34:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-08 04:34:57] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 13 ms returned sat
[2021-05-08 04:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:34:58] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2021-05-08 04:34:58] [INFO ] Computed and/alt/rep : 443/1883/443 causal constraints (skipped 1409 transitions) in 92 ms.
[2021-05-08 04:34:59] [INFO ] Added : 43 causal constraints over 13 iterations in 1163 ms. Result :sat
Minimization took 365 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 132900 steps, including 1840 resets, run finished after 510 ms. (steps per millisecond=260 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 762 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 762/762 places, 1901/1901 transitions.
Graph (complete) has 4730 edges and 762 vertex of which 761 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 761 transition count 1901
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 760 transition count 1900
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 760 transition count 1900
Applied a total of 4 rules in 87 ms. Remains 760 /762 variables (removed 2) and now considering 1900/1901 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/762 places, 1900/1901 transitions.
// Phase 1: matrix 1900 rows 760 cols
[2021-05-08 04:35:00] [INFO ] Computed 69 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 16268 resets, run finished after 3648 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2141 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 1) seen :0
// Phase 1: matrix 1900 rows 760 cols
[2021-05-08 04:35:05] [INFO ] Computed 69 place invariants in 19 ms
[2021-05-08 04:35:05] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 04:35:05] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 14 ms returned sat
[2021-05-08 04:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 04:35:05] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2021-05-08 04:35:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 04:35:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2021-05-08 04:35:06] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2021-05-08 04:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 04:35:07] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2021-05-08 04:35:07] [INFO ] Computed and/alt/rep : 442/1881/442 causal constraints (skipped 1409 transitions) in 100 ms.
[2021-05-08 04:35:08] [INFO ] Added : 54 causal constraints over 11 iterations in 1017 ms. Result :sat
Minimization took 487 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 156600 steps, including 3181 resets, run finished after 609 ms. (steps per millisecond=257 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 760 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 760/760 places, 1900/1900 transitions.
Applied a total of 0 rules in 32 ms. Remains 760 /760 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1900/1900 transitions.
Starting structural reductions, iteration 0 : 760/760 places, 1900/1900 transitions.
Applied a total of 0 rules in 32 ms. Remains 760 /760 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
// Phase 1: matrix 1900 rows 760 cols
[2021-05-08 04:35:09] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:35:09] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 1900 rows 760 cols
[2021-05-08 04:35:09] [INFO ] Computed 69 place invariants in 26 ms
[2021-05-08 04:35:11] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2021-05-08 04:35:11] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 1900 rows 760 cols
[2021-05-08 04:35:11] [INFO ] Computed 69 place invariants in 18 ms
[2021-05-08 04:35:12] [INFO ] Dead Transitions using invariants and state equation in 732 ms returned []
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1900/1900 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-12 in 24328 ms.
[2021-05-08 04:35:12] [INFO ] Flatten gal took : 216 ms
[2021-05-08 04:35:12] [INFO ] Applying decomposition
[2021-05-08 04:35:12] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3465647668150525738.txt, -o, /tmp/graph3465647668150525738.bin, -w, /tmp/graph3465647668150525738.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3465647668150525738.bin, -l, -1, -v, -w, /tmp/graph3465647668150525738.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 04:35:13] [INFO ] Decomposing Gal with order
[2021-05-08 04:35:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 04:35:13] [INFO ] Removed a total of 3893 redundant transitions.
[2021-05-08 04:35:13] [INFO ] Flatten gal took : 215 ms
[2021-05-08 04:35:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 41 ms.
[2021-05-08 04:35:13] [INFO ] Time to serialize gal into /tmp/UpperBounds6324508422260690051.gal : 19 ms
[2021-05-08 04:35:13] [INFO ] Time to serialize properties into /tmp/UpperBounds15189058176175289847.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds6324508422260690051.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15189058176175289847.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds6324508422260690051.gal -t CGAL -reachable-file /tmp/UpperBounds15189058176175289847.prop --nowitness
Loading property file /tmp/UpperBounds15189058176175289847.prop.
Detected timeout of ITS tools.
[2021-05-08 04:59:29] [INFO ] Applying decomposition
[2021-05-08 04:59:29] [INFO ] Flatten gal took : 86 ms
[2021-05-08 04:59:29] [INFO ] Decomposing Gal with order
[2021-05-08 04:59:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 04:59:30] [INFO ] Removed a total of 3622 redundant transitions.
[2021-05-08 04:59:30] [INFO ] Flatten gal took : 179 ms
[2021-05-08 04:59:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1519 labels/synchronizations in 50 ms.
[2021-05-08 04:59:30] [INFO ] Time to serialize gal into /tmp/UpperBounds13663914135644505066.gal : 8 ms
[2021-05-08 04:59:35] [INFO ] Time to serialize properties into /tmp/UpperBounds17162213215355916103.prop : 5698 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13663914135644505066.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17162213215355916103.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13663914135644505066.gal -t CGAL -reachable-file /tmp/UpperBounds17162213215355916103.prop --nowitness
Loading property file /tmp/UpperBounds17162213215355916103.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10b, 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 r007-tall-162037989600165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10b.tgz
mv ASLink-PT-10b 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 ;