About the Execution of ITS-Tools for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16244.863 | 3600000.00 | 2907328.00 | 438733.60 | 7 6 7 7 6 7 7 7 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.r140-tall-162089128200635.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 Peterson-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.2M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 48K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 148K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 105K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 351K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Mar 27 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Mar 27 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Mar 25 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 25 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Peterson-PT-6-UpperBounds-00
FORMULA_NAME Peterson-PT-6-UpperBounds-01
FORMULA_NAME Peterson-PT-6-UpperBounds-02
FORMULA_NAME Peterson-PT-6-UpperBounds-03
FORMULA_NAME Peterson-PT-6-UpperBounds-04
FORMULA_NAME Peterson-PT-6-UpperBounds-05
FORMULA_NAME Peterson-PT-6-UpperBounds-06
FORMULA_NAME Peterson-PT-6-UpperBounds-07
FORMULA_NAME Peterson-PT-6-UpperBounds-08
FORMULA_NAME Peterson-PT-6-UpperBounds-09
FORMULA_NAME Peterson-PT-6-UpperBounds-10
FORMULA_NAME Peterson-PT-6-UpperBounds-11
FORMULA_NAME Peterson-PT-6-UpperBounds-12
FORMULA_NAME Peterson-PT-6-UpperBounds-13
FORMULA_NAME Peterson-PT-6-UpperBounds-14
FORMULA_NAME Peterson-PT-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621025967167
Running Version 0
[2021-05-14 20:59:29] [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-14 20:59:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:59:29] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2021-05-14 20:59:29] [INFO ] Transformed 1330 places.
[2021-05-14 20:59:29] [INFO ] Transformed 2030 transitions.
[2021-05-14 20:59:29] [INFO ] Found NUPN structural information;
[2021-05-14 20:59:29] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
FORMULA Peterson-PT-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1820 out of 2030 initially.
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:59:29] [INFO ] Computed 27 place invariants in 33 ms
FORMULA Peterson-PT-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :25
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-08 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 7) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :20
[2021-05-14 20:59:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2021-05-14 20:59:29] [INFO ] Computed 27 place invariants in 14 ms
[2021-05-14 20:59:30] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned unsat
[2021-05-14 20:59:30] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned unsat
[2021-05-14 20:59:30] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned unsat
[2021-05-14 20:59:30] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2021-05-14 20:59:30] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:31] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2021-05-14 20:59:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:59:31] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2021-05-14 20:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:32] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2021-05-14 20:59:32] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 20:59:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 125 ms returned sat
[2021-05-14 20:59:32] [INFO ] Deduced a trap composed of 329 places in 590 ms of which 19 ms to minimize.
[2021-05-14 20:59:33] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 2 ms to minimize.
[2021-05-14 20:59:34] [INFO ] Deduced a trap composed of 12 places in 598 ms of which 2 ms to minimize.
[2021-05-14 20:59:34] [INFO ] Deduced a trap composed of 27 places in 405 ms of which 2 ms to minimize.
[2021-05-14 20:59:35] [INFO ] Deduced a trap composed of 12 places in 549 ms of which 0 ms to minimize.
[2021-05-14 20:59:35] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2021-05-14 20:59:36] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 1 ms to minimize.
[2021-05-14 20:59:36] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2021-05-14 20:59:36] [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 3
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:2244)
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-14 20:59:36] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:59:36] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:37] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-14 20:59:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:59:37] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:38] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2021-05-14 20:59:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 124 ms returned sat
[2021-05-14 20:59:38] [INFO ] Deduced a trap composed of 213 places in 527 ms of which 1 ms to minimize.
[2021-05-14 20:59:39] [INFO ] Deduced a trap composed of 168 places in 566 ms of which 1 ms to minimize.
[2021-05-14 20:59:40] [INFO ] Deduced a trap composed of 29 places in 688 ms of which 5 ms to minimize.
[2021-05-14 20:59:40] [INFO ] Deduced a trap composed of 253 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:59:41] [INFO ] Deduced a trap composed of 29 places in 505 ms of which 1 ms to minimize.
[2021-05-14 20:59:41] [INFO ] Deduced a trap composed of 212 places in 502 ms of which 1 ms to minimize.
[2021-05-14 20:59:42] [INFO ] Deduced a trap composed of 387 places in 508 ms of which 1 ms to minimize.
[2021-05-14 20:59:42] [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 4
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:2244)
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-14 20:59:42] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 20:59:42] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:43] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2021-05-14 20:59:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2021-05-14 20:59:43] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:43] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2021-05-14 20:59:44] [INFO ] [Nat]Added 366 Read/Feed constraints in 109 ms returned sat
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 189 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:59:44] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 1 ms to minimize.
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 97 places in 402 ms of which 1 ms to minimize.
[2021-05-14 20:59:45] [INFO ] Deduced a trap composed of 68 places in 395 ms of which 1 ms to minimize.
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 237 places in 414 ms of which 1 ms to minimize.
[2021-05-14 20:59:46] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 1 ms to minimize.
[2021-05-14 20:59:47] [INFO ] Deduced a trap composed of 264 places in 405 ms of which 0 ms to minimize.
[2021-05-14 20:59:47] [INFO ] Deduced a trap composed of 264 places in 418 ms of which 1 ms to minimize.
[2021-05-14 20:59:48] [INFO ] Deduced a trap composed of 264 places in 406 ms of which 1 ms to minimize.
[2021-05-14 20:59:48] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 1 ms to minimize.
[2021-05-14 20:59:48] [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 5
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:2244)
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-14 20:59:48] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2021-05-14 20:59:48] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:49] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-14 20:59:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:59:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2021-05-14 20:59:49] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 20:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:59:50] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2021-05-14 20:59:50] [INFO ] [Nat]Added 366 Read/Feed constraints in 105 ms returned sat
[2021-05-14 20:59:50] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2021-05-14 20:59:51] [INFO ] Deduced a trap composed of 12 places in 514 ms of which 1 ms to minimize.
[2021-05-14 20:59:51] [INFO ] Deduced a trap composed of 12 places in 506 ms of which 1 ms to minimize.
[2021-05-14 20:59:52] [INFO ] Deduced a trap composed of 15 places in 508 ms of which 1 ms to minimize.
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 12 places in 514 ms of which 0 ms to minimize.
[2021-05-14 20:59:53] [INFO ] Deduced a trap composed of 12 places in 525 ms of which 1 ms to minimize.
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 12 places in 532 ms of which 1 ms to minimize.
[2021-05-14 20:59:54] [INFO ] Deduced a trap composed of 41 places in 504 ms of which 1 ms to minimize.
[2021-05-14 20:59:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:2244)
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)
Current structural bounds on expressions (after SMT) : [7, 7, 7, 1, 1, 1, 1] Max seen :[7, 7, 7, 0, 0, 0, 0]
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 583 transitions
Trivial Post-agglo rules discarded 583 transitions
Performed 583 trivial Post agglomeration. Transition count delta: 583
Iterating post reduction 0 with 583 rules applied. Total rules applied 583 place count 1330 transition count 1447
Reduce places removed 583 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 585 rules applied. Total rules applied 1168 place count 747 transition count 1445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 1170 place count 745 transition count 1153
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1754 place count 453 transition count 1153
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1838 place count 411 transition count 1111
Applied a total of 1838 rules in 199 ms. Remains 411 /1330 variables (removed 919) and now considering 1111/2030 (removed 919) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/1330 places, 1111/2030 transitions.
Normalized transition count is 901 out of 1111 initially.
// Phase 1: matrix 901 rows 411 cols
[2021-05-14 20:59:54] [INFO ] Computed 27 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2736 ms. (steps per millisecond=365 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 4) seen :0
[2021-05-14 21:00:00] [INFO ] Flow matrix only has 901 transitions (discarded 210 similar events)
// Phase 1: matrix 901 rows 411 cols
[2021-05-14 21:00:00] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:00] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-14 21:00:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:00] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-14 21:00:00] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:00:00] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:00:00] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:00:01] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:00:02] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2021-05-14 21:00:03] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2021-05-14 21:00:04] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3771 ms
[2021-05-14 21:00:04] [INFO ] Computed and/alt/rep : 810/2833/810 causal constraints (skipped 84 transitions) in 58 ms.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 8 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:00:09] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2021-05-14 21:00:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1479 ms
[2021-05-14 21:00:10] [INFO ] Added : 491 causal constraints over 99 iterations in 5958 ms. Result :sat
Minimization took 245 ms.
[2021-05-14 21:00:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:00:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:11] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-14 21:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:11] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 21:00:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 39 ms returned sat
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:00:11] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:00:12] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:00:13] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 13 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:00:14] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2021-05-14 21:00:15] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2021-05-14 21:00:16] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5041 ms
[2021-05-14 21:00:16] [INFO ] Computed and/alt/rep : 810/2833/810 causal constraints (skipped 84 transitions) in 61 ms.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:00:20] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:00:21] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:00:22] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:00:22] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:00:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2569 ms
[2021-05-14 21:00:22] [INFO ] Added : 418 causal constraints over 84 iterations in 6444 ms. Result :sat
Minimization took 267 ms.
[2021-05-14 21:00:23] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:23] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-14 21:00:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:23] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-14 21:00:23] [INFO ] [Nat]Added 366 Read/Feed constraints in 39 ms returned sat
[2021-05-14 21:00:23] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:00:23] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:00:24] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:00:25] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:00:26] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2712 ms
[2021-05-14 21:00:26] [INFO ] Computed and/alt/rep : 810/2833/810 causal constraints (skipped 84 transitions) in 50 ms.
[2021-05-14 21:00:30] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:00:30] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:00:30] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 0 ms to minimize.
[2021-05-14 21:00:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1211 ms
[2021-05-14 21:00:31] [INFO ] Added : 463 causal constraints over 93 iterations in 5403 ms. Result :sat
Minimization took 218 ms.
[2021-05-14 21:00:32] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:32] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-14 21:00:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:32] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-14 21:00:32] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:00:32] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:00:32] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:00:32] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:00:33] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 1 ms to minimize.
[2021-05-14 21:00:34] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2021-05-14 21:00:35] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2021-05-14 21:00:36] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2021-05-14 21:00:37] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:00:38] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:00:39] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:00:40] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:00:41] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:00:42] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2021-05-14 21:00:43] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2021-05-14 21:00:43] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2021-05-14 21:00:43] [INFO ] Trap strengthening (SAT) tested/added 79/78 trap constraints in 10704 ms
[2021-05-14 21:00:43] [INFO ] Computed and/alt/rep : 810/2833/810 causal constraints (skipped 84 transitions) in 57 ms.
[2021-05-14 21:00:46] [INFO ] Added : 325 causal constraints over 65 iterations in 3044 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 96200 steps, including 1000 resets, run finished after 307 ms. (steps per millisecond=313 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 103800 steps, including 1000 resets, run finished after 271 ms. (steps per millisecond=383 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 151200 steps, including 1000 resets, run finished after 410 ms. (steps per millisecond=368 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 154200 steps, including 1000 resets, run finished after 389 ms. (steps per millisecond=396 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Peterson-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 411/411 places, 1111/1111 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 411 transition count 1110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 410 transition count 1110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 410 transition count 1108
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 408 transition count 1108
Applied a total of 6 rules in 32 ms. Remains 408 /411 variables (removed 3) and now considering 1108/1111 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 408/411 places, 1108/1111 transitions.
Normalized transition count is 898 out of 1108 initially.
// Phase 1: matrix 898 rows 408 cols
[2021-05-14 21:00:47] [INFO ] Computed 27 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2673 ms. (steps per millisecond=374 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 2) seen :0
[2021-05-14 21:00:51] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2021-05-14 21:00:51] [INFO ] Computed 27 place invariants in 3 ms
[2021-05-14 21:00:52] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:00:52] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-14 21:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:52] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-14 21:00:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:00:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:00:52] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 0 ms returned sat
[2021-05-14 21:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:00:52] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-14 21:00:52] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:00:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 42 ms returned sat
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:00:52] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 1 ms to minimize.
[2021-05-14 21:00:53] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:00:54] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:00:55] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:00:56] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:00:57] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-14 21:00:58] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:00:59] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2021-05-14 21:01:00] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2021-05-14 21:01:01] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 8884 ms
[2021-05-14 21:01:01] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 47 ms.
[2021-05-14 21:01:06] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:01:06] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:01:07] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:01:07] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:01:07] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:01:07] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:01:07] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:01:08] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:01:09] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:01:10] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:01:10] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2021-05-14 21:01:10] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2021-05-14 21:01:10] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3670 ms
[2021-05-14 21:01:10] [INFO ] Added : 590 causal constraints over 119 iterations in 9035 ms. Result :sat
Minimization took 344 ms.
[2021-05-14 21:01:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:01:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:11] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2021-05-14 21:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:01:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:01:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-14 21:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:11] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-14 21:01:11] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:01:11] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:01:11] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:11] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:12] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:01:13] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2021-05-14 21:01:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2534 ms
[2021-05-14 21:01:14] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 47 ms.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:01:19] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:01:20] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:01:21] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:01:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2297 ms
[2021-05-14 21:01:21] [INFO ] Added : 557 causal constraints over 113 iterations in 7314 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 94100 steps, including 1000 resets, run finished after 251 ms. (steps per millisecond=374 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 139700 steps, including 1000 resets, run finished after 355 ms. (steps per millisecond=393 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 28 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 408/408 places, 1108/1108 transitions.
Starting structural reductions, iteration 0 : 408/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 26 ms. Remains 408 /408 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2021-05-14 21:01:22] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 408 cols
[2021-05-14 21:01:22] [INFO ] Computed 27 place invariants in 3 ms
[2021-05-14 21:01:22] [INFO ] Implicit Places using invariants in 268 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 271 ms to find 7 implicit places.
[2021-05-14 21:01:22] [INFO ] Redundant transitions in 68 ms returned []
[2021-05-14 21:01:22] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:01:22] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:01:23] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Starting structural reductions, iteration 1 : 401/408 places, 1108/1108 transitions.
Applied a total of 0 rules in 18 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2021-05-14 21:01:23] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-14 21:01:23] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:01:23] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:01:23] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Finished structural reductions, in 2 iterations. Remains : 401/408 places, 1108/1108 transitions.
Normalized transition count is 898 out of 1108 initially.
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:01:23] [INFO ] Computed 20 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2616 ms. (steps per millisecond=382 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 2) seen :0
[2021-05-14 21:01:27] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:01:27] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:01:27] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:27] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-14 21:01:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:01:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:27] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-14 21:01:27] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:01:27] [INFO ] [Nat]Added 366 Read/Feed constraints in 38 ms returned sat
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:01:28] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:01:29] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 1 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:01:30] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 0 ms to minimize.
[2021-05-14 21:01:31] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:01:32] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2021-05-14 21:01:33] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 5944 ms
[2021-05-14 21:01:33] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 47 ms.
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:01:38] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:01:39] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 1 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:01:40] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:01:41] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:01:42] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:01:43] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:01:44] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 0 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:01:45] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:01:46] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 0 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:01:47] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 9133 ms
[2021-05-14 21:01:47] [INFO ] Added : 512 causal constraints over 104 iterations in 13831 ms. Result :sat
Minimization took 318 ms.
[2021-05-14 21:01:48] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2021-05-14 21:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:48] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-14 21:01:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:01:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:01:48] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-14 21:01:48] [INFO ] [Nat]Added 366 Read/Feed constraints in 41 ms returned sat
[2021-05-14 21:01:48] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:01:48] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:01:49] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 1 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:01:50] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2021-05-14 21:01:51] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2021-05-14 21:01:52] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 0 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 1 ms to minimize.
[2021-05-14 21:01:53] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 1 ms to minimize.
[2021-05-14 21:01:54] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 1 ms to minimize.
[2021-05-14 21:01:54] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 5427 ms
[2021-05-14 21:01:54] [INFO ] Computed and/alt/rep : 807/2830/807 causal constraints (skipped 84 transitions) in 58 ms.
[2021-05-14 21:01:59] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2021-05-14 21:01:59] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2021-05-14 21:01:59] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:01:59] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2021-05-14 21:02:00] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2021-05-14 21:02:01] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2021-05-14 21:02:01] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 0 ms to minimize.
[2021-05-14 21:02:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1912 ms
[2021-05-14 21:02:01] [INFO ] Added : 594 causal constraints over 119 iterations in 7264 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 80200 steps, including 1000 resets, run finished after 214 ms. (steps per millisecond=374 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 176000 steps, including 1000 resets, run finished after 433 ms. (steps per millisecond=406 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 401 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 1108/1108 transitions.
Starting structural reductions, iteration 0 : 401/401 places, 1108/1108 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
[2021-05-14 21:02:02] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:02] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:02:02] [INFO ] Implicit Places using invariants in 259 ms returned []
[2021-05-14 21:02:02] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:02] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-14 21:02:02] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:02:04] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2021-05-14 21:02:04] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-14 21:02:04] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:04] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:04] [INFO ] Dead Transitions using invariants and state equation in 432 ms returned []
Finished structural reductions, in 1 iterations. Remains : 401/401 places, 1108/1108 transitions.
Starting property specific reduction for Peterson-PT-6-UpperBounds-11
Normalized transition count is 898 out of 1108 initially.
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:04] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2021-05-14 21:02:04] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:04] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 21:02:04] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-14 21:02:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:05] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-14 21:02:05] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:02:05] [INFO ] [Nat]Added 366 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:02:05] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:02:06] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:02:07] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 12 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:08] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:02:09] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:10] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:02:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 401 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 401/401 places, 1106/1106 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 400 transition count 1104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 400 transition count 1103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 399 transition count 1103
Applied a total of 3 rules in 23 ms. Remains 399 /401 variables (removed 2) and now considering 1103/1106 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/401 places, 1103/1106 transitions.
Normalized transition count is 893 out of 1103 initially.
// Phase 1: matrix 893 rows 399 cols
[2021-05-14 21:02:10] [INFO ] Computed 20 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2620 ms. (steps per millisecond=381 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 1) seen :0
[2021-05-14 21:02:13] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2021-05-14 21:02:13] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:13] [INFO ] [Real]Absence check using 20 positive place invariants in 70 ms returned sat
[2021-05-14 21:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:13] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-14 21:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:13] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2021-05-14 21:02:13] [INFO ] State equation strengthened by 364 read => feed constraints.
[2021-05-14 21:02:14] [INFO ] [Nat]Added 364 Read/Feed constraints in 36 ms returned sat
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:02:14] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:02:15] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:02:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:02:17] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2021-05-14 21:02:18] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 0 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2021-05-14 21:02:19] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 0 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2021-05-14 21:02:20] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 0 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2021-05-14 21:02:21] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 1 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2021-05-14 21:02:22] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2021-05-14 21:02:23] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 1 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 0 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:02:24] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 0 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 0 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2021-05-14 21:02:25] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 1 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:02:26] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2021-05-14 21:02:27] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2021-05-14 21:02:27] [INFO ] Trap strengthening (SAT) tested/added 87/86 trap constraints in 13058 ms
[2021-05-14 21:02:27] [INFO ] Computed and/alt/rep : 802/2822/802 causal constraints (skipped 84 transitions) in 58 ms.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:02:34] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2021-05-14 21:02:35] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2021-05-14 21:02:36] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2021-05-14 21:02:36] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2021-05-14 21:02:36] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:02:36] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2021-05-14 21:02:36] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 0 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:02:37] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2021-05-14 21:02:38] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2021-05-14 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4215 ms
[2021-05-14 21:02:38] [INFO ] Added : 714 causal constraints over 143 iterations in 11148 ms. Result :sat
Minimization took 635 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 189600 steps, including 1000 resets, run finished after 455 ms. (steps per millisecond=416 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 1103/1103 transitions.
Applied a total of 0 rules in 16 ms. Remains 399 /399 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1103/1103 transitions.
Starting structural reductions, iteration 0 : 399/399 places, 1103/1103 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2021-05-14 21:02:39] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2021-05-14 21:02:39] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:39] [INFO ] Implicit Places using invariants in 252 ms returned []
[2021-05-14 21:02:39] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2021-05-14 21:02:39] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2021-05-14 21:02:41] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2021-05-14 21:02:41] [INFO ] Redundant transitions in 12 ms returned []
[2021-05-14 21:02:41] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2021-05-14 21:02:41] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:41] [INFO ] Dead Transitions using invariants and state equation in 434 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1103/1103 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-11 in 37227 ms.
Starting property specific reduction for Peterson-PT-6-UpperBounds-12
Normalized transition count is 898 out of 1108 initially.
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:41] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2021-05-14 21:02:42] [INFO ] Flow matrix only has 898 transitions (discarded 210 similar events)
// Phase 1: matrix 898 rows 401 cols
[2021-05-14 21:02:42] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:02:42] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:42] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-14 21:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:42] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-14 21:02:42] [INFO ] State equation strengthened by 366 read => feed constraints.
[2021-05-14 21:02:42] [INFO ] [Nat]Added 366 Read/Feed constraints in 43 ms returned sat
[2021-05-14 21:02:42] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:42] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:42] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2021-05-14 21:02:43] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2021-05-14 21:02:44] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:02:45] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2021-05-14 21:02:46] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2021-05-14 21:02:47] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2021-05-14 21:02:47] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2021-05-14 21:02: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 401 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 401/401 places, 1106/1106 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 400 transition count 1104
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 399 transition count 1102
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 398 transition count 1100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3 place count 398 transition count 1099
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5 place count 397 transition count 1099
Applied a total of 5 rules in 27 ms. Remains 397 /401 variables (removed 4) and now considering 1099/1106 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 397/401 places, 1099/1106 transitions.
Normalized transition count is 889 out of 1099 initially.
// Phase 1: matrix 889 rows 397 cols
[2021-05-14 21:02:47] [INFO ] Computed 20 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2601 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 1) seen :0
[2021-05-14 21:02:50] [INFO ] Flow matrix only has 889 transitions (discarded 210 similar events)
// Phase 1: matrix 889 rows 397 cols
[2021-05-14 21:02:50] [INFO ] Computed 20 place invariants in 15 ms
[2021-05-14 21:02:50] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2021-05-14 21:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:50] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-14 21:02:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:02:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2021-05-14 21:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:02:51] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 21:02:51] [INFO ] State equation strengthened by 362 read => feed constraints.
[2021-05-14 21:02:51] [INFO ] [Nat]Added 362 Read/Feed constraints in 40 ms returned sat
[2021-05-14 21:02:51] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2021-05-14 21:02:51] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:02:51] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:02:51] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2021-05-14 21:02:51] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2021-05-14 21:02:52] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 0 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2021-05-14 21:02:53] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2021-05-14 21:02:54] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 1 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:55] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2021-05-14 21:02:56] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2021-05-14 21:02:57] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2021-05-14 21:02:58] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 0 ms to minimize.
[2021-05-14 21:02:59] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 8826 ms
[2021-05-14 21:03:00] [INFO ] Computed and/alt/rep : 798/2810/798 causal constraints (skipped 84 transitions) in 47 ms.
[2021-05-14 21:03:02] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2021-05-14 21:03:02] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2021-05-14 21:03:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2021-05-14 21:03:03] [INFO ] Added : 326 causal constraints over 66 iterations in 3061 ms. Result :sat
Minimization took 206 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 86100 steps, including 1000 resets, run finished after 224 ms. (steps per millisecond=384 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 397 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 397/397 places, 1099/1099 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 1099/1099 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 397/397 places, 1099/1099 transitions.
Starting structural reductions, iteration 0 : 397/397 places, 1099/1099 transitions.
Applied a total of 0 rules in 21 ms. Remains 397 /397 variables (removed 0) and now considering 1099/1099 (removed 0) transitions.
[2021-05-14 21:03:03] [INFO ] Flow matrix only has 889 transitions (discarded 210 similar events)
// Phase 1: matrix 889 rows 397 cols
[2021-05-14 21:03:03] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-14 21:03:03] [INFO ] Implicit Places using invariants in 238 ms returned []
[2021-05-14 21:03:03] [INFO ] Flow matrix only has 889 transitions (discarded 210 similar events)
// Phase 1: matrix 889 rows 397 cols
[2021-05-14 21:03:03] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 21:03:04] [INFO ] State equation strengthened by 362 read => feed constraints.
[2021-05-14 21:03:05] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2021-05-14 21:03:05] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-14 21:03:05] [INFO ] Flow matrix only has 889 transitions (discarded 210 similar events)
// Phase 1: matrix 889 rows 397 cols
[2021-05-14 21:03:05] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-14 21:03:05] [INFO ] Dead Transitions using invariants and state equation in 410 ms returned []
Finished structural reductions, in 1 iterations. Remains : 397/397 places, 1099/1099 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-12 in 23972 ms.
[2021-05-14 21:03:06] [INFO ] Flatten gal took : 129 ms
[2021-05-14 21:03:06] [INFO ] Applying decomposition
[2021-05-14 21:03:06] [INFO ] Flatten gal took : 64 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/graph16617085487824624569.txt, -o, /tmp/graph16617085487824624569.bin, -w, /tmp/graph16617085487824624569.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/graph16617085487824624569.bin, -l, -1, -v, -w, /tmp/graph16617085487824624569.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 21:03:06] [INFO ] Decomposing Gal with order
[2021-05-14 21:03:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:03:06] [INFO ] Removed a total of 1579 redundant transitions.
[2021-05-14 21:03:06] [INFO ] Flatten gal took : 182 ms
[2021-05-14 21:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 407 labels/synchronizations in 55 ms.
[2021-05-14 21:03:06] [INFO ] Time to serialize gal into /tmp/UpperBounds13300262913467390685.gal : 15 ms
[2021-05-14 21:03:06] [INFO ] Time to serialize properties into /tmp/UpperBounds17692887637821025715.prop : 0 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/UpperBounds13300262913467390685.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17692887637821025715.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/UpperBounds13300262913467390685.gal -t CGAL -reachable-file /tmp/UpperBounds17692887637821025715.prop --nowitness
Loading property file /tmp/UpperBounds17692887637821025715.prop.
Detected timeout of ITS tools.
[2021-05-14 21:24:19] [INFO ] Applying decomposition
[2021-05-14 21:24:19] [INFO ] Flatten gal took : 48 ms
[2021-05-14 21:24:19] [INFO ] Decomposing Gal with order
[2021-05-14 21:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 21:24:19] [INFO ] Removed a total of 1354 redundant transitions.
[2021-05-14 21:24:19] [INFO ] Flatten gal took : 187 ms
[2021-05-14 21:24:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 30 ms.
[2021-05-14 21:24:21] [INFO ] Time to serialize gal into /tmp/UpperBounds17088651116657492015.gal : 1754 ms
[2021-05-14 21:24:21] [INFO ] Time to serialize properties into /tmp/UpperBounds16309152269079178708.prop : 0 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/UpperBounds17088651116657492015.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16309152269079178708.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/UpperBounds17088651116657492015.gal -t CGAL -reachable-file /tmp/UpperBounds16309152269079178708.prop --nowitness
Loading property file /tmp/UpperBounds16309152269079178708.prop.
Detected timeout of ITS tools.
[2021-05-14 21:45:47] [INFO ] Flatten gal took : 300 ms
[2021-05-14 21:45:48] [INFO ] Input system was already deterministic with 1108 transitions.
[2021-05-14 21:45:48] [INFO ] Transformed 401 places.
[2021-05-14 21:45:48] [INFO ] Transformed 1108 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 21:45:48] [INFO ] Time to serialize gal into /tmp/UpperBounds8114173372348409980.gal : 32 ms
[2021-05-14 21:45:48] [INFO ] Time to serialize properties into /tmp/UpperBounds307899867403206460.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/UpperBounds8114173372348409980.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds307899867403206460.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/UpperBounds8114173372348409980.gal -t CGAL -reachable-file /tmp/UpperBounds307899867403206460.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds307899867403206460.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="Peterson-PT-6"
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 Peterson-PT-6, 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 r140-tall-162089128200635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 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 ;