About the Execution of ITS-Tools for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3678.644 | 903510.00 | 2682373.00 | 3579.40 | FFTTFFTFTFTTTTFT | 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-162089128200623.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-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200623
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 697K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M 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 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 27 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 08:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 25 08:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K 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 520K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621021065247
Running Version 0
[2021-05-14 19:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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 19:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:37:49] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2021-05-14 19:37:49] [INFO ] Transformed 480 places.
[2021-05-14 19:37:49] [INFO ] Transformed 690 transitions.
[2021-05-14 19:37:49] [INFO ] Found NUPN structural information;
[2021-05-14 19:37:49] [INFO ] Parsed PT model containing 480 places and 690 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :9
FORMULA Peterson-PT-4-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :1
FORMULA Peterson-PT-4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2021-05-14 19:37:49] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2021-05-14 19:37:49] [INFO ] Computed 19 place invariants in 14 ms
[2021-05-14 19:37:50] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2021-05-14 19:37:50] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-14 19:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:50] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2021-05-14 19:37:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:37:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 33 ms returned sat
[2021-05-14 19:37:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 19:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:51] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2021-05-14 19:37:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:37:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 45 ms returned sat
[2021-05-14 19:37:51] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 4 ms to minimize.
[2021-05-14 19:37:52] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2021-05-14 19:37:52] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 1 ms to minimize.
[2021-05-14 19:37:52] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2021-05-14 19:37:52] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2021-05-14 19:37:52] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 1 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2021-05-14 19:37:53] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 0 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 1 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 0 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:37:54] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 0 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:37:55] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:37:56] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:37:56] [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
[2021-05-14 19:37:56] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:37:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 19:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:56] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-14 19:37:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:37:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-14 19:37:56] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:37:56] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-14 19:37:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:37:56] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:37:56] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:37:56] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2021-05-14 19:37:56] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 5 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:37:57] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 0 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:37:58] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:37:59] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 1 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 8 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 0 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:38:00] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2021-05-14 19:38:01] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:38:01] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:38:01] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:38:01] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 0 ms to minimize.
[2021-05-14 19:38:01] [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 1
[2021-05-14 19:38:01] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:38:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-14 19:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:01] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-14 19:38:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:38:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:38:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:02] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-14 19:38:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:38:02] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2021-05-14 19:38:02] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2021-05-14 19:38:02] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2021-05-14 19:38:02] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2021-05-14 19:38:02] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 0 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2021-05-14 19:38:03] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 1 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 1 ms to minimize.
[2021-05-14 19:38:04] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:38:05] [INFO ] Deduced a trap composed of 113 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:38:06] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4324 ms
[2021-05-14 19:38:06] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 29 ms.
[2021-05-14 19:38:07] [INFO ] Deduced a trap composed of 2 places in 165 ms of which 1 ms to minimize.
[2021-05-14 19:38:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-14 19:38:07] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:07] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 19:38:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:38:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 0 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:07] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-14 19:38:07] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 19:38:07] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2021-05-14 19:38:07] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:38:07] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 1 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2021-05-14 19:38:08] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 1 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 0 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2021-05-14 19:38:09] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:38:10] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:38:10] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 1 ms to minimize.
[2021-05-14 19:38:10] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:38:10] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:38:10] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2968 ms
[2021-05-14 19:38:10] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 34 ms.
[2021-05-14 19:38:12] [INFO ] Added : 275 causal constraints over 55 iterations in 1783 ms. Result :unknown
[2021-05-14 19:38:12] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:12] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 19:38:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:38:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:12] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-14 19:38:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 23 ms returned sat
[2021-05-14 19:38:12] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2021-05-14 19:38:13] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 0 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 0 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:38:14] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:38:15] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:38:15] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:38:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 2386 ms
[2021-05-14 19:38:15] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:38:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:15] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-14 19:38:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:38:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:38:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:38:15] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-14 19:38:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2021-05-14 19:38:15] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:38:16] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 0 ms to minimize.
[2021-05-14 19:38:17] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:38:18] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2909 ms
[2021-05-14 19:38:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 33 ms.
[2021-05-14 19:38:20] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 1 ms to minimize.
[2021-05-14 19:38:20] [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
FORMULA Peterson-PT-4-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 135300 steps, including 1000 resets, run finished after 485 ms. (steps per millisecond=278 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 281 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 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 480 transition count 689
Reduce places removed 1 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 21 rules applied. Total rules applied 22 place count 479 transition count 669
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 42 place count 459 transition count 669
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 456 transition count 666
Applied a total of 48 rules in 100 ms. Remains 456 /480 variables (removed 24) and now considering 666/690 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 456/480 places, 666/690 transitions.
[2021-05-14 19:38:24] [INFO ] Flatten gal took : 93 ms
[2021-05-14 19:38:24] [INFO ] Flatten gal took : 35 ms
[2021-05-14 19:38:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10950548056747013634.gal : 51 ms
[2021-05-14 19:38:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5239181026446002217.prop : 6 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/ReachabilityCardinality10950548056747013634.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5239181026446002217.prop, --nowitness, --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/ReachabilityCardinality10950548056747013634.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5239181026446002217.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5239181026446002217.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :10 after 30
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :30 after 67
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :67 after 126
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :126 after 212
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :212 after 1067
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1067 after 3935
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3935 after 7650
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :7650 after 38876
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :38876 after 144392
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :144392 after 390977
Detected timeout of ITS tools.
[2021-05-14 19:38:39] [INFO ] Flatten gal took : 32 ms
[2021-05-14 19:38:39] [INFO ] Applying decomposition
[2021-05-14 19:38:39] [INFO ] Flatten gal took : 30 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/graph6832263444138518552.txt, -o, /tmp/graph6832263444138518552.bin, -w, /tmp/graph6832263444138518552.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/graph6832263444138518552.bin, -l, -1, -v, -w, /tmp/graph6832263444138518552.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:38:39] [INFO ] Decomposing Gal with order
[2021-05-14 19:38:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:38:39] [INFO ] Removed a total of 487 redundant transitions.
[2021-05-14 19:38:39] [INFO ] Flatten gal took : 95 ms
[2021-05-14 19:38:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 27 ms.
[2021-05-14 19:38:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7116993012517237460.gal : 26 ms
[2021-05-14 19:38:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7715524954934873496.prop : 2 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/ReachabilityCardinality7116993012517237460.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7715524954934873496.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/ReachabilityCardinality7116993012517237460.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7715524954934873496.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7715524954934873496.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 12
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :12 after 392
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :392 after 24060
Reachability property Peterson-PT-4-ReachabilityFireability-11 is true.
FORMULA Peterson-PT-4-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :24060 after 590282
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13988037600065763608
[2021-05-14 19:38:55] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13988037600065763608
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13988037600065763608]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13988037600065763608] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13988037600065763608] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3797 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 395869 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 4) seen :1
FORMULA Peterson-PT-4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 3) seen :1
FORMULA Peterson-PT-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-14 19:39:07] [INFO ] Flow matrix only has 606 transitions (discarded 60 similar events)
// Phase 1: matrix 606 rows 456 cols
[2021-05-14 19:39:07] [INFO ] Computed 19 place invariants in 7 ms
[2021-05-14 19:39:08] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2021-05-14 19:39:08] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2021-05-14 19:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:39:08] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2021-05-14 19:39:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:39:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 19:39:09] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2021-05-14 19:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:39:09] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2021-05-14 19:39:09] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:39:09] [INFO ] [Nat]Added 132 Read/Feed constraints in 27 ms returned sat
[2021-05-14 19:39:09] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 4 ms to minimize.
[2021-05-14 19:39:09] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:39:10] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 0 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:39:11] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 11 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:12] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:39:13] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Deduced a trap composed of 128 places in 69 ms of which 0 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 0 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:39:14] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 4779 ms
[2021-05-14 19:39:14] [INFO ] Computed and/alt/rep : 565/1022/565 causal constraints (skipped 36 transitions) in 34 ms.
[2021-05-14 19:39:18] [INFO ] Added : 559 causal constraints over 112 iterations in 4228 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-14 19:39:18] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2021-05-14 19:39:18] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:39:18] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-14 19:39:18] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2021-05-14 19:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:39:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-14 19:39:19] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2021-05-14 19:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:39:19] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-14 19:39:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 19:39:19] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2021-05-14 19:39:19] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2021-05-14 19:39:19] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2021-05-14 19:39:19] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
[2021-05-14 19:39:19] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2021-05-14 19:39:20] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
[2021-05-14 19:39:21] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2021-05-14 19:39:22] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2021-05-14 19:39:23] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:39:23] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:39:23] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4027 ms
[2021-05-14 19:39:23] [INFO ] Computed and/alt/rep : 565/1022/565 causal constraints (skipped 36 transitions) in 31 ms.
[2021-05-14 19:39:25] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:39:25] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 0 ms to minimize.
[2021-05-14 19:39:25] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:39:26] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 0 ms to minimize.
[2021-05-14 19:39:26] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:39:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 719 ms
[2021-05-14 19:39:26] [INFO ] Added : 344 causal constraints over 70 iterations in 3130 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 210000 steps, including 1000 resets, run finished after 551 ms. (steps per millisecond=381 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Peterson-PT-4-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59200 steps, including 941 resets, run finished after 187 ms. (steps per millisecond=316 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 270 out of 456 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 456/456 places, 666/666 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 665
Applied a total of 2 rules in 27 ms. Remains 455 /456 variables (removed 1) and now considering 665/666 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 455/456 places, 665/666 transitions.
[2021-05-14 19:39:27] [INFO ] Flatten gal took : 25 ms
[2021-05-14 19:39:27] [INFO ] Flatten gal took : 28 ms
[2021-05-14 19:39:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2222355401438135248.gal : 2 ms
[2021-05-14 19:39:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6494546825596734667.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/ReachabilityCardinality2222355401438135248.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6494546825596734667.prop, --nowitness, --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/ReachabilityCardinality2222355401438135248.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6494546825596734667.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6494546825596734667.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :30 after 67
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :67 after 126
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :126 after 212
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :212 after 1157
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1157 after 4157
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4157 after 7780
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7780 after 39264
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :39264 after 145570
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :145570 after 399793
Detected timeout of ITS tools.
[2021-05-14 19:39:42] [INFO ] Flatten gal took : 29 ms
[2021-05-14 19:39:42] [INFO ] Applying decomposition
[2021-05-14 19:39:42] [INFO ] Flatten gal took : 20 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/graph135502066139421926.txt, -o, /tmp/graph135502066139421926.bin, -w, /tmp/graph135502066139421926.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/graph135502066139421926.bin, -l, -1, -v, -w, /tmp/graph135502066139421926.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:39:42] [INFO ] Decomposing Gal with order
[2021-05-14 19:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:39:42] [INFO ] Removed a total of 513 redundant transitions.
[2021-05-14 19:39:42] [INFO ] Flatten gal took : 38 ms
[2021-05-14 19:39:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2021-05-14 19:39:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10327814403258258004.gal : 9 ms
[2021-05-14 19:39:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14528391480246041236.prop : 2 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/ReachabilityCardinality10327814403258258004.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14528391480246041236.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/ReachabilityCardinality10327814403258258004.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14528391480246041236.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14528391480246041236.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 287
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :287 after 422
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :422 after 20803
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20803 after 164782
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14833651183347796830
[2021-05-14 19:39:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14833651183347796830
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14833651183347796830]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14833651183347796830] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14833651183347796830] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2731 ms. (steps per millisecond=366 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 382555 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted probabilistic random walk after 8721486 steps, run timeout after 30001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 8721486 steps, saw 1472647 distinct states, run finished after 30001 ms. (steps per millisecond=290 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-14 19:40:36] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 455 cols
[2021-05-14 19:40:36] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 19:40:36] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2021-05-14 19:40:36] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2021-05-14 19:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:37] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2021-05-14 19:40:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:40:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 19:40:37] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2021-05-14 19:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:40:37] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2021-05-14 19:40:37] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:40:37] [INFO ] [Nat]Added 132 Read/Feed constraints in 19 ms returned sat
[2021-05-14 19:40:37] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 1 ms to minimize.
[2021-05-14 19:40:37] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:40:38] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 0 ms to minimize.
[2021-05-14 19:40:39] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2021-05-14 19:40:40] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2021-05-14 19:40:41] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 8 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2021-05-14 19:40:42] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:40:43] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:40:44] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2021-05-14 19:40:45] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2021-05-14 19:40:45] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:40:45] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:40:45] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 0 ms to minimize.
[2021-05-14 19:40:45] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 7660 ms
[2021-05-14 19:40:45] [INFO ] Computed and/alt/rep : 564/1021/564 causal constraints (skipped 36 transitions) in 31 ms.
[2021-05-14 19:40:50] [INFO ] Added : 563 causal constraints over 113 iterations in 5210 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 218400 steps, including 1000 resets, run finished after 579 ms. (steps per millisecond=377 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 270 out of 455 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 455/455 places, 665/665 transitions.
Applied a total of 0 rules in 17 ms. Remains 455 /455 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 455/455 places, 665/665 transitions.
Starting structural reductions, iteration 0 : 455/455 places, 665/665 transitions.
Applied a total of 0 rules in 15 ms. Remains 455 /455 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 19:40:51] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 455 cols
[2021-05-14 19:40:51] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-14 19:40:51] [INFO ] Implicit Places using invariants in 106 ms returned [442, 443, 444, 445, 446]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 107 ms to find 5 implicit places.
[2021-05-14 19:40:51] [INFO ] Redundant transitions in 36 ms returned []
[2021-05-14 19:40:51] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:40:51] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 19:40:51] [INFO ] Dead Transitions using invariants and state equation in 289 ms returned []
Starting structural reductions, iteration 1 : 450/455 places, 665/665 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 19:40:51] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-14 19:40:51] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:40:51] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:40:52] [INFO ] Dead Transitions using invariants and state equation in 335 ms returned []
Finished structural reductions, in 2 iterations. Remains : 450/455 places, 665/665 transitions.
[2021-05-14 19:40:52] [INFO ] Flatten gal took : 22 ms
[2021-05-14 19:40:52] [INFO ] Flatten gal took : 32 ms
[2021-05-14 19:40:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17882847781213301965.gal : 2 ms
[2021-05-14 19:40:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality139412907202998059.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/ReachabilityCardinality17882847781213301965.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality139412907202998059.prop, --nowitness, --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/ReachabilityCardinality17882847781213301965.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality139412907202998059.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality139412907202998059.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10 after 28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28 after 60
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :60 after 150
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :150 after 431
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :431 after 1406
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1406 after 4264
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4264 after 7820
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7820 after 41670
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :41670 after 172570
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :172570 after 414706
Detected timeout of ITS tools.
[2021-05-14 19:41:07] [INFO ] Flatten gal took : 19 ms
[2021-05-14 19:41:07] [INFO ] Applying decomposition
[2021-05-14 19:41:07] [INFO ] Flatten gal took : 19 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/graph5080750120000693459.txt, -o, /tmp/graph5080750120000693459.bin, -w, /tmp/graph5080750120000693459.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/graph5080750120000693459.bin, -l, -1, -v, -w, /tmp/graph5080750120000693459.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:41:07] [INFO ] Decomposing Gal with order
[2021-05-14 19:41:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:41:07] [INFO ] Removed a total of 517 redundant transitions.
[2021-05-14 19:41:07] [INFO ] Flatten gal took : 36 ms
[2021-05-14 19:41:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2021-05-14 19:41:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16365757497357279871.gal : 32 ms
[2021-05-14 19:41:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6616854150259726554.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/ReachabilityCardinality16365757497357279871.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6616854150259726554.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/ReachabilityCardinality16365757497357279871.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6616854150259726554.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6616854150259726554.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 44260
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11256259970151812928
[2021-05-14 19:41:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11256259970151812928
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11256259970151812928]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11256259970151812928] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11256259970151812928] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2734 ms. (steps per millisecond=365 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 375619 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :{}
Interrupted probabilistic random walk after 8708664 steps, run timeout after 30001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 8708664 steps, saw 1470498 distinct states, run finished after 30001 ms. (steps per millisecond=290 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-14 19:42:01] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:42:01] [INFO ] Computed 14 place invariants in 13 ms
[2021-05-14 19:42:01] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 19:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:42:01] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2021-05-14 19:42:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:42:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 19:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:42:02] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2021-05-14 19:42:02] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:42:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 20 ms returned sat
[2021-05-14 19:42:02] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2021-05-14 19:42:02] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2021-05-14 19:42:02] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:42:02] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:42:02] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2021-05-14 19:42:03] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 0 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2021-05-14 19:42:04] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 0 ms to minimize.
[2021-05-14 19:42:05] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2021-05-14 19:42:05] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2021-05-14 19:42:05] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 0 ms to minimize.
[2021-05-14 19:42:05] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2946 ms
[2021-05-14 19:42:05] [INFO ] Computed and/alt/rep : 564/1021/564 causal constraints (skipped 36 transitions) in 31 ms.
[2021-05-14 19:42:09] [INFO ] Added : 562 causal constraints over 113 iterations in 4408 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Incomplete Parikh walk after 225900 steps, including 1000 resets, run finished after 576 ms. (steps per millisecond=392 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 270 out of 450 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 450/450 places, 665/665 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 665/665 transitions.
Starting structural reductions, iteration 0 : 450/450 places, 665/665 transitions.
Applied a total of 0 rules in 10 ms. Remains 450 /450 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2021-05-14 19:42:10] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:42:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:42:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2021-05-14 19:42:10] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:42:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:42:10] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:42:10] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2021-05-14 19:42:10] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-14 19:42:10] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:42:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:42:10] [INFO ] Dead Transitions using invariants and state equation in 304 ms returned []
Finished structural reductions, in 1 iterations. Remains : 450/450 places, 665/665 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2021-05-14 19:42:11] [INFO ] Flow matrix only has 605 transitions (discarded 60 similar events)
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:42:11] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:42:11] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 19:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:42:12] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2021-05-14 19:42:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:42:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 19:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:42:12] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2021-05-14 19:42:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2021-05-14 19:42:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 21 ms returned sat
[2021-05-14 19:42:12] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2021-05-14 19:42:12] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 0 ms to minimize.
[2021-05-14 19:42:13] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 1 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 0 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 0 ms to minimize.
[2021-05-14 19:42:14] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 0 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 0 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 0 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:42:15] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2989 ms
[2021-05-14 19:42:15] [INFO ] Computed and/alt/rep : 564/1021/564 causal constraints (skipped 36 transitions) in 37 ms.
[2021-05-14 19:42:20] [INFO ] Added : 562 causal constraints over 113 iterations in 4438 ms. Result :sat
[2021-05-14 19:42:20] [INFO ] Flatten gal took : 18 ms
[2021-05-14 19:42:20] [INFO ] Flatten gal took : 18 ms
[2021-05-14 19:42:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6520991044737781866.gal : 2 ms
[2021-05-14 19:42:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15814044500501005099.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/ReachabilityCardinality6520991044737781866.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15814044500501005099.prop, --nowitness, --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/ReachabilityCardinality6520991044737781866.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15814044500501005099.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15814044500501005099.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10 after 28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28 after 60
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :60 after 150
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :150 after 431
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :431 after 1406
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1406 after 4264
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4264 after 7820
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7820 after 41670
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :41670 after 172570
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :172570 after 414706
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :414706 after 1.95125e+06
Detected timeout of ITS tools.
[2021-05-14 19:42:40] [INFO ] Flatten gal took : 17 ms
[2021-05-14 19:42:40] [INFO ] Applying decomposition
[2021-05-14 19:42:40] [INFO ] Flatten gal took : 17 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/graph11232893349722795907.txt, -o, /tmp/graph11232893349722795907.bin, -w, /tmp/graph11232893349722795907.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/graph11232893349722795907.bin, -l, -1, -v, -w, /tmp/graph11232893349722795907.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:42:40] [INFO ] Decomposing Gal with order
[2021-05-14 19:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:42:40] [INFO ] Removed a total of 517 redundant transitions.
[2021-05-14 19:42:40] [INFO ] Flatten gal took : 34 ms
[2021-05-14 19:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2021-05-14 19:42:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3085310451303659681.gal : 4 ms
[2021-05-14 19:42:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8206547728793384437.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/ReachabilityCardinality3085310451303659681.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8206547728793384437.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/ReachabilityCardinality3085310451303659681.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8206547728793384437.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8206547728793384437.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 62
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :62 after 452
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :452 after 66450
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :66450 after 2.2868e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.2868e+06 after 9.04669e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3509904802139513936
[2021-05-14 19:43:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3509904802139513936
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3509904802139513936]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3509904802139513936] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3509904802139513936] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 450 transition count 605
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 450 transition count 601
Applied a total of 64 rules in 23 ms. Remains 450 /450 variables (removed 0) and now considering 601/665 (removed 64) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 601 rows 450 cols
[2021-05-14 19:43:02] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 19:43:02] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-14 19:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:43:03] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2021-05-14 19:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:43:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2021-05-14 19:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:43:03] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2021-05-14 19:43:03] [INFO ] Computed and/alt/rep : 596/1193/596 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-14 19:43:07] [INFO ] Added : 591 causal constraints over 119 iterations in 4327 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2021-05-14 19:43:07] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4357233232463197858
[2021-05-14 19:43:08] [INFO ] Computing symmetric may disable matrix : 665 transitions.
[2021-05-14 19:43:08] [INFO ] Flatten gal took : 24 ms
[2021-05-14 19:43:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:43:08] [INFO ] Computing symmetric may enable matrix : 665 transitions.
[2021-05-14 19:43:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:43:08] [INFO ] Applying decomposition
[2021-05-14 19:43:08] [INFO ] Flatten gal took : 39 ms
[2021-05-14 19:43:08] [INFO ] Input system was already deterministic with 665 transitions.
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/graph11348150214980779756.txt, -o, /tmp/graph11348150214980779756.bin, -w, /tmp/graph11348150214980779756.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/graph11348150214980779756.bin, -l, -1, -v, -w, /tmp/graph11348150214980779756.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:43:08] [INFO ] Decomposing Gal with order
[2021-05-14 19:43:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:43:08] [INFO ] Removed a total of 504 redundant transitions.
[2021-05-14 19:43:08] [INFO ] Flatten gal took : 66 ms
[2021-05-14 19:43:08] [INFO ] Computing Do-Not-Accords matrix : 665 transitions.
[2021-05-14 19:43:08] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 19:43:08] [INFO ] Built C files in 353ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4357233232463197858
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4357233232463197858]
[2021-05-14 19:43:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 23 ms.
[2021-05-14 19:43:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9269045168078215457.gal : 17 ms
[2021-05-14 19:43:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2094032615289091870.prop : 14 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/ReachabilityFireability9269045168078215457.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2094032615289091870.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/ReachabilityFireability9269045168078215457.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2094032615289091870.prop --nowitness
Loading property file /tmp/ReachabilityFireability2094032615289091870.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 120
[2021-05-14 19:43:08] [INFO ] Ran tautology test, simplified 0 / 1 in 911 ms.
[2021-05-14 19:43:09] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-05(UNSAT) depth K=0 took 36 ms
[2021-05-14 19:43:09] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-05(UNSAT) depth K=1 took 161 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 605 out of 665 initially.
// Phase 1: matrix 605 rows 450 cols
[2021-05-14 19:43:09] [INFO ] Computed 14 place invariants in 4 ms
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_4 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + EndTurn_0_0 + EndTurn_0_1 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_0_0 + BeginLoop_0_3_0 + BeginLoop_0_0_1 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_3_1 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_0_2 + BeginLoop_0_1_3 + BeginLoop_0_3_2 + BeginLoop_0_0_3 + BeginLoop_0_0_4 + BeginLoop_0_3_3 + BeginLoop_0_2_3 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_1_4 + WantSection_0_F + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_2_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_1_3 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_1_2 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestTurn_0_0 + TestTurn_0_1 + TestAlone_0_2_3 + TestAlone_0_3_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestTurn_0_2 + TestTurn_0_3 + TestIdentity_0_0_2 + TestIdentity_0_3_1 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_1_1 + TestIdentity_0_0_1 + TestIdentity_0_2_1 + TestIdentity_0_3_3 + TestIdentity_0_0_4 + TestIdentity_0_2_3 + TestIdentity_0_0_3 + TestIdentity_0_1_3 + TestIdentity_0_3_2 + TestIdentity_0_3_4 + TestIdentity_0_1_4 + TestIdentity_0_2_4 + CS_0 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_3_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_0_4 + IsEndLoop_3_3_3 + IsEndLoop_3_1_4 + IsEndLoop_3_2_4 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_3_2 + BeginLoop_3_0_0 + EndTurn_3_3 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_1_0 + BeginLoop_3_2_1 + BeginLoop_3_0_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_3_1 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_0_4 + BeginLoop_3_3_3 + BeginLoop_3_2_3 + BeginLoop_3_3_4 + BeginLoop_3_2_4 + BeginLoop_3_1_4 + TestAlone_3_1_0 + TestAlone_3_0_0 + WantSection_3_F + TestAlone_3_1_1 + TestAlone_3_0_1 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_2_2 + TestAlone_3_3_2 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestTurn_3_0 + TestAlone_3_0_4 + TestIdentity_3_1_0 + TestIdentity_3_0_0 + TestIdentity_3_3_0 + TestIdentity_3_2_0 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_3 + TestIdentity_3_3_1 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_0_1 + TestIdentity_3_2_1 + TestIdentity_3_1_1 + TestIdentity_3_2_2 + TestIdentity_3_3_2 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + TestIdentity_3_0_4 + TestIdentity_3_1_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + CS_3 = 1
inv : Turn_2_2 + Turn_2_3 + Turn_2_0 + Turn_2_1 + Turn_2_4 = 1
inv : Turn_1_2 + Turn_1_3 + Turn_1_0 + Turn_1_1 + Turn_1_4 = 1
inv : WantSection_1_F + WantSection_1_T = 1
inv : Turn_0_2 + Turn_0_3 + Turn_0_0 + Turn_0_1 + Turn_0_4 = 1
inv : WantSection_2_F + WantSection_2_T = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_3_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_2_2 + BeginLoop_2_0_0 + EndTurn_2_3 + BeginLoop_2_3_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_0_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_3_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_3_2 + BeginLoop_2_0_4 + BeginLoop_2_3_3 + BeginLoop_2_2_3 + BeginLoop_2_3_4 + BeginLoop_2_2_4 + BeginLoop_2_1_4 + TestAlone_2_1_0 + TestAlone_2_0_0 + WantSection_2_F + TestAlone_2_1_1 + TestAlone_2_0_1 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestTurn_2_0 + TestAlone_2_2_3 + TestAlone_2_3_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestIdentity_2_1_0 + TestIdentity_2_3_0 + TestIdentity_2_2_0 + TestTurn_2_2 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_3 + TestIdentity_2_3_1 + TestIdentity_2_0_1 + TestIdentity_2_2_1 + TestIdentity_2_1_1 + TestIdentity_2_3_3 + TestIdentity_2_0_4 + TestIdentity_2_1_3 + TestIdentity_2_2_3 + TestIdentity_2_0_3 + TestIdentity_2_2_4 + TestIdentity_2_3_4 + TestIdentity_2_1_4 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + CS_2 = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_3_2 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_0_4 + IsEndLoop_4_3_3 + IsEndLoop_4_1_4 + IsEndLoop_4_2_4 + EndTurn_4_0 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_0_0 + EndTurn_4_3 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_1_0 + BeginLoop_4_1_1 + BeginLoop_4_2_1 + BeginLoop_4_0_1 + BeginLoop_4_1_2 + BeginLoop_4_3_1 + BeginLoop_4_0_2 + BeginLoop_4_0_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_0_4 + BeginLoop_4_3_3 + BeginLoop_4_2_3 + BeginLoop_4_1_3 + BeginLoop_4_3_4 + BeginLoop_4_2_4 + BeginLoop_4_1_4 + TestAlone_4_0_0 + WantSection_4_F + TestAlone_4_0_1 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_1_2 + TestAlone_4_2_2 + TestAlone_4_3_2 + TestAlone_4_0_3 + TestAlone_4_1_1 + TestAlone_4_2_1 + TestAlone_4_3_1 + TestAlone_4_0_2 + TestTurn_4_0 + TestAlone_4_1_3 + TestAlone_4_2_3 + TestAlone_4_3_3 + TestIdentity_4_1_0 + TestIdentity_4_0_0 + TestIdentity_4_2_0 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_3 + TestIdentity_4_3_1 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_0_1 + TestIdentity_4_3_0 + TestIdentity_4_2_1 + TestIdentity_4_1_1 + TestIdentity_4_3_3 + TestIdentity_4_1_3 + TestIdentity_4_2_3 + TestIdentity_4_3_2 + TestIdentity_4_0_3 + TestIdentity_4_2_2 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + CS_4 = 1
inv : WantSection_3_F + WantSection_3_T = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_3_3 + IsEndLoop_1_2_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_0_0 + BeginLoop_1_3_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_3_2 + BeginLoop_1_0_4 + BeginLoop_1_3_3 + BeginLoop_1_2_3 + BeginLoop_1_3_4 + BeginLoop_1_2_4 + BeginLoop_1_1_4 + TestAlone_1_1_0 + TestAlone_1_0_0 + WantSection_1_F + TestAlone_1_3_0 + TestAlone_1_2_0 + TestAlone_1_2_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_1_3 + TestAlone_1_0_2 + TestAlone_1_1_2 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestTurn_1_0 + TestTurn_1_1 + TestAlone_1_2_3 + TestAlone_1_3_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestIdentity_1_1_0 + TestIdentity_1_3_0 + TestIdentity_1_2_0 + TestTurn_1_2 + TestIdentity_1_0_0 + TestTurn_1_3 + TestIdentity_1_0_2 + TestIdentity_1_1_2 + TestIdentity_1_3_3 + TestIdentity_1_0_4 + TestIdentity_1_2_3 + TestIdentity_1_0_3 + TestIdentity_1_1_3 + TestIdentity_1_2_2 + TestIdentity_1_3_2 + TestIdentity_1_2_4 + TestIdentity_1_3_4 + TestIdentity_1_1_4 + CS_1 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 = 1
inv : WantSection_4_F + WantSection_4_T = 1
inv : Turn_3_1 + Turn_3_2 + Turn_3_0 + Turn_3_4 + Turn_3_3 = 1
Total of 14 invariants.
[2021-05-14 19:43:09] [INFO ] Computed 14 place invariants in 6 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :120 after 166199
[2021-05-14 19:43:10] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-05(UNSAT) depth K=2 took 1022 ms
[2021-05-14 19:43:10] [INFO ] Proved 450 variables to be positive in 970 ms
[2021-05-14 19:43:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-05
[2021-05-14 19:43:10] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-05(SAT) depth K=0 took 111 ms
[2021-05-14 19:43:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-05
[2021-05-14 19:43:10] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-05(SAT) depth K=1 took 216 ms
Compilation finished in 4861 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4357233232463197858]
Link finished in 55 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT4ReachabilityFireability05==true], workingDir=/tmp/ltsmin4357233232463197858]
[2021-05-14 19:43:18] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-05(UNSAT) depth K=3 took 7993 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :166199 after 4.30754e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.30754e+06 after 1.04662e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.04662e+07 after 1.38455e+07
[2021-05-14 19:46:00] [INFO ] BMC solution for property Peterson-PT-4-ReachabilityFireability-05(UNSAT) depth K=4 took 161883 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.38455e+07 after 3.41366e+07
[2021-05-14 19:47:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-4-ReachabilityFireability-05
[2021-05-14 19:47:03] [INFO ] KInduction solution for property Peterson-PT-4-ReachabilityFireability-05(SAT) depth K=2 took 232639 ms
Invariant property Peterson-PT-4-ReachabilityFireability-05 does not hold.
FORMULA Peterson-PT-4-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.31724e+07,160.048,1199376,23551,229,1.3924e+06,13031,1160,9.99455e+06,120,87444,0
Total reachable state count : 83172384
Verifying 1 reachability properties.
Invariant property Peterson-PT-4-ReachabilityFireability-05 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-ReachabilityFireability-05,11748,213.557,1199376,1990,89,1.3924e+06,13031,3101,9.99455e+06,206,87444,0
[2021-05-14 19:52:47] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-14 19:52:47] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-4-ReachabilityFireability-05 K-induction depth 3
Exception in thread "Thread-27" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2021-05-14 19:52:47] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-14 19:52:47] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-PT-4-ReachabilityFireability-05 SMT depth 5
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2021-05-14 19:52:47] [INFO ] During BMC, SMT solver timed out at depth 5
[2021-05-14 19:52:47] [INFO ] BMC solving timed out (3600000 secs) at depth 5
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2021-05-14 19:52:47] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
BK_STOP 1621021968757
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-4"
export BK_EXAMINATION="ReachabilityFireability"
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-4, examination is ReachabilityFireability"
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-162089128200623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;