About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16239.892 | 3600000.00 | 11277893.00 | 27852.00 | TTTTF?TFT??T?TF? | 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-162089128200647.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-7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200647
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 1.4M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.8M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 335K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 380K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 159K Mar 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 427K Mar 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127K Mar 25 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 418K Mar 25 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K 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 2.3M 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-7-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621031541329
Running Version 0
[2021-05-14 22:32:22] [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 22:32:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 22:32:23] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2021-05-14 22:32:23] [INFO ] Transformed 1992 places.
[2021-05-14 22:32:23] [INFO ] Transformed 3096 transitions.
[2021-05-14 22:32:23] [INFO ] Found NUPN structural information;
[2021-05-14 22:32:23] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 16) seen :7
FORMULA Peterson-PT-7-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :1
FORMULA Peterson-PT-7-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :1
FORMULA Peterson-PT-7-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2021-05-14 22:32:24] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2021-05-14 22:32:24] [INFO ] Computed 31 place invariants in 48 ms
[2021-05-14 22:32:24] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2021-05-14 22:32:24] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-14 22:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:27] [INFO ] [Real]Absence check using state equation in 2319 ms returned sat
[2021-05-14 22:32:27] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:32:27] [INFO ] [Real]Added 546 Read/Feed constraints in 136 ms returned sat
[2021-05-14 22:32:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:32:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2021-05-14 22:32:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-14 22:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:30] [INFO ] [Nat]Absence check using state equation in 2275 ms returned sat
[2021-05-14 22:32:30] [INFO ] [Nat]Added 546 Read/Feed constraints in 169 ms returned sat
[2021-05-14 22:32:31] [INFO ] Deduced a trap composed of 65 places in 1185 ms of which 5 ms to minimize.
[2021-05-14 22:32:32] [INFO ] Deduced a trap composed of 13 places in 1158 ms of which 4 ms to minimize.
[2021-05-14 22:32:32] [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 22:32:33] [INFO ] [Real]Absence check using 23 positive place invariants in 75 ms returned sat
[2021-05-14 22:32:33] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 57 ms returned sat
[2021-05-14 22:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:37] [INFO ] [Real]Absence check using state equation in 4577 ms returned unknown
[2021-05-14 22:32:38] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:32:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:39] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2021-05-14 22:32:39] [INFO ] [Real]Added 546 Read/Feed constraints in 123 ms returned sat
[2021-05-14 22:32:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:32:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 53 ms returned sat
[2021-05-14 22:32:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-14 22:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:40] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2021-05-14 22:32:40] [INFO ] [Nat]Added 546 Read/Feed constraints in 155 ms returned sat
[2021-05-14 22:32:41] [INFO ] Deduced a trap composed of 13 places in 801 ms of which 9 ms to minimize.
[2021-05-14 22:32:42] [INFO ] Deduced a trap composed of 92 places in 750 ms of which 2 ms to minimize.
[2021-05-14 22:32:43] [INFO ] Deduced a trap composed of 21 places in 755 ms of which 1 ms to minimize.
[2021-05-14 22:32:44] [INFO ] Deduced a trap composed of 58 places in 719 ms of which 1 ms to minimize.
[2021-05-14 22:32:44] [INFO ] Deduced a trap composed of 66 places in 732 ms of which 1 ms to minimize.
[2021-05-14 22:32:44] [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 22:32:45] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:32:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:45] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2021-05-14 22:32:46] [INFO ] [Real]Added 546 Read/Feed constraints in 137 ms returned sat
[2021-05-14 22:32:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:32:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 22:32:46] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:47] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2021-05-14 22:32:47] [INFO ] [Nat]Added 546 Read/Feed constraints in 169 ms returned sat
[2021-05-14 22:32:48] [INFO ] Deduced a trap composed of 36 places in 765 ms of which 2 ms to minimize.
[2021-05-14 22:32:49] [INFO ] Deduced a trap composed of 34 places in 740 ms of which 1 ms to minimize.
[2021-05-14 22:32:50] [INFO ] Deduced a trap composed of 58 places in 743 ms of which 1 ms to minimize.
[2021-05-14 22:32:50] [INFO ] Deduced a trap composed of 36 places in 753 ms of which 1 ms to minimize.
[2021-05-14 22:32:51] [INFO ] Deduced a trap composed of 36 places in 743 ms of which 1 ms to minimize.
[2021-05-14 22:32:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 22:32:52] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:32:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:52] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2021-05-14 22:32:53] [INFO ] [Real]Added 546 Read/Feed constraints in 149 ms returned sat
[2021-05-14 22:32:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:32:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2021-05-14 22:32:53] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:54] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2021-05-14 22:32:54] [INFO ] [Nat]Added 546 Read/Feed constraints in 168 ms returned sat
[2021-05-14 22:32:55] [INFO ] Deduced a trap composed of 59 places in 929 ms of which 2 ms to minimize.
[2021-05-14 22:32:56] [INFO ] Deduced a trap composed of 126 places in 898 ms of which 1 ms to minimize.
[2021-05-14 22:32:57] [INFO ] Deduced a trap composed of 161 places in 901 ms of which 1 ms to minimize.
[2021-05-14 22:32:58] [INFO ] Deduced a trap composed of 58 places in 906 ms of which 1 ms to minimize.
[2021-05-14 22:32:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-14 22:32:58] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2021-05-14 22:32:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:32:59] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2021-05-14 22:32:59] [INFO ] [Real]Added 546 Read/Feed constraints in 144 ms returned sat
[2021-05-14 22:32:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:33:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 22:33:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:33:00] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2021-05-14 22:33:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 188 ms returned sat
[2021-05-14 22:33:02] [INFO ] Deduced a trap composed of 28 places in 899 ms of which 2 ms to minimize.
[2021-05-14 22:33:03] [INFO ] Deduced a trap composed of 29 places in 903 ms of which 2 ms to minimize.
[2021-05-14 22:33:04] [INFO ] Deduced a trap composed of 17 places in 902 ms of which 2 ms to minimize.
[2021-05-14 22:33:05] [INFO ] Deduced a trap composed of 17 places in 909 ms of which 1 ms to minimize.
[2021-05-14 22:33:05] [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
[2021-05-14 22:33:05] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2021-05-14 22:33:05] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:33:06] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2021-05-14 22:33:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:33:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2021-05-14 22:33:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:33:07] [INFO ] [Nat]Absence check using state equation in 900 ms returned sat
[2021-05-14 22:33:07] [INFO ] [Nat]Added 546 Read/Feed constraints in 148 ms returned sat
[2021-05-14 22:33:08] [INFO ] Deduced a trap composed of 30 places in 763 ms of which 1 ms to minimize.
[2021-05-14 22:33:09] [INFO ] Deduced a trap composed of 13 places in 753 ms of which 1 ms to minimize.
[2021-05-14 22:33:10] [INFO ] Deduced a trap composed of 13 places in 776 ms of which 1 ms to minimize.
[2021-05-14 22:33:11] [INFO ] Deduced a trap composed of 13 places in 751 ms of which 1 ms to minimize.
[2021-05-14 22:33:12] [INFO ] Deduced a trap composed of 13 places in 755 ms of which 1 ms to minimize.
[2021-05-14 22:33:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
Fused 7 Parikh solutions to 1 different solutions.
Support contains 532 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 483 rules applied. Total rules applied 483 place count 1992 transition count 2613
Reduce places removed 483 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 484 rules applied. Total rules applied 967 place count 1509 transition count 2612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 968 place count 1508 transition count 2612
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 968 place count 1508 transition count 2214
Deduced a syphon composed of 398 places in 4 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Applied a total of 1764 rules in 337 ms. Remains 1110 /1992 variables (removed 882) and now considering 2214/3096 (removed 882) transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1992 places, 2214/3096 transitions.
[2021-05-14 22:33:12] [INFO ] Flatten gal took : 194 ms
[2021-05-14 22:33:12] [INFO ] Flatten gal took : 104 ms
[2021-05-14 22:33:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10664178976563935508.gal : 34 ms
[2021-05-14 22:33:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality82890051327389952.prop : 4 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/ReachabilityCardinality10664178976563935508.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality82890051327389952.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/ReachabilityCardinality10664178976563935508.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality82890051327389952.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality82890051327389952.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :7 after 20
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :20 after 21
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :21 after 31
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :31 after 48
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :48 after 71
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :71 after 94
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :94 after 298
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :298 after 699
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :699 after 1559
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1559 after 5550
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :5550 after 13264
Detected timeout of ITS tools.
[2021-05-14 22:33:28] [INFO ] Flatten gal took : 86 ms
[2021-05-14 22:33:28] [INFO ] Applying decomposition
[2021-05-14 22:33:28] [INFO ] Flatten gal took : 81 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/graph15180135012992079597.txt, -o, /tmp/graph15180135012992079597.bin, -w, /tmp/graph15180135012992079597.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/graph15180135012992079597.bin, -l, -1, -v, -w, /tmp/graph15180135012992079597.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:33:28] [INFO ] Decomposing Gal with order
[2021-05-14 22:33:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:33:28] [INFO ] Removed a total of 2833 redundant transitions.
[2021-05-14 22:33:28] [INFO ] Flatten gal took : 203 ms
[2021-05-14 22:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-14 22:33:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2766192176328754012.gal : 18 ms
[2021-05-14 22:33:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10867598848120129871.prop : 3 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/ReachabilityCardinality2766192176328754012.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10867598848120129871.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/ReachabilityCardinality2766192176328754012.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10867598848120129871.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10867598848120129871.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 1620
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1620 after 18641
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :18641 after 359648
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9401007877896985297
[2021-05-14 22:33:44] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9401007877896985297
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/ltsmin9401007877896985297]
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/ltsmin9401007877896985297] 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/ltsmin9401007877896985297] 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 9659 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties (out of 7) seen :0
Interrupted Best-First random walk after 172188 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=34 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 2966760 steps, run timeout after 30001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 2966760 steps, saw 970356 distinct states, run finished after 30001 ms. (steps per millisecond=98 ) properties seen :{}
Running SMT prover for 7 properties.
[2021-05-14 22:34:38] [INFO ] Flow matrix only has 1878 transitions (discarded 336 similar events)
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:34:38] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-14 22:34:38] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2021-05-14 22:34:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:34:39] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2021-05-14 22:34:39] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:34:39] [INFO ] [Real]Added 546 Read/Feed constraints in 76 ms returned sat
[2021-05-14 22:34:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:34:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2021-05-14 22:34:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:34:40] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2021-05-14 22:34:41] [INFO ] [Nat]Added 546 Read/Feed constraints in 89 ms returned sat
[2021-05-14 22:34:41] [INFO ] Deduced a trap composed of 18 places in 482 ms of which 1 ms to minimize.
[2021-05-14 22:34:42] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 1 ms to minimize.
[2021-05-14 22:34:42] [INFO ] Deduced a trap composed of 36 places in 480 ms of which 0 ms to minimize.
[2021-05-14 22:34:43] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 1 ms to minimize.
[2021-05-14 22:34:43] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2021-05-14 22:34:44] [INFO ] Deduced a trap composed of 19 places in 474 ms of which 3 ms to minimize.
[2021-05-14 22:34:44] [INFO ] Deduced a trap composed of 56 places in 478 ms of which 1 ms to minimize.
[2021-05-14 22:34:45] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 1 ms to minimize.
[2021-05-14 22:34:45] [INFO ] Deduced a trap composed of 20 places in 477 ms of which 2 ms to minimize.
[2021-05-14 22:34:46] [INFO ] Deduced a trap composed of 32 places in 478 ms of which 1 ms to minimize.
[2021-05-14 22:34:46] [INFO ] Deduced a trap composed of 38 places in 480 ms of which 1 ms to minimize.
[2021-05-14 22:34:47] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 1 ms to minimize.
[2021-05-14 22:34:48] [INFO ] Deduced a trap composed of 18 places in 466 ms of which 1 ms to minimize.
[2021-05-14 22:34:48] [INFO ] Deduced a trap composed of 14 places in 477 ms of which 1 ms to minimize.
[2021-05-14 22:34:49] [INFO ] Deduced a trap composed of 38 places in 464 ms of which 1 ms to minimize.
[2021-05-14 22:34:49] [INFO ] Deduced a trap composed of 38 places in 469 ms of which 1 ms to minimize.
[2021-05-14 22:34:50] [INFO ] Deduced a trap composed of 18 places in 465 ms of which 1 ms to minimize.
[2021-05-14 22:34:50] [INFO ] Deduced a trap composed of 38 places in 459 ms of which 10 ms to minimize.
[2021-05-14 22:34:51] [INFO ] Deduced a trap composed of 80 places in 450 ms of which 1 ms to minimize.
[2021-05-14 22:34:51] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 1 ms to minimize.
[2021-05-14 22:34:52] [INFO ] Deduced a trap composed of 82 places in 452 ms of which 1 ms to minimize.
[2021-05-14 22:34:52] [INFO ] Deduced a trap composed of 55 places in 450 ms of which 1 ms to minimize.
[2021-05-14 22:34:53] [INFO ] Deduced a trap composed of 53 places in 455 ms of which 0 ms to minimize.
[2021-05-14 22:34:53] [INFO ] Deduced a trap composed of 62 places in 445 ms of which 0 ms to minimize.
[2021-05-14 22:34:54] [INFO ] Deduced a trap composed of 71 places in 445 ms of which 1 ms to minimize.
[2021-05-14 22:34:54] [INFO ] Deduced a trap composed of 37 places in 449 ms of which 1 ms to minimize.
[2021-05-14 22:34:55] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 0 ms to minimize.
[2021-05-14 22:34:55] [INFO ] Deduced a trap composed of 26 places in 444 ms of which 1 ms to minimize.
[2021-05-14 22:34:56] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 1 ms to minimize.
[2021-05-14 22:34:57] [INFO ] Deduced a trap composed of 67 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:34:57] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:34:57] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 1 ms to minimize.
[2021-05-14 22:34:58] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:34:58] [INFO ] Deduced a trap composed of 48 places in 410 ms of which 0 ms to minimize.
[2021-05-14 22:34:59] [INFO ] Deduced a trap composed of 30 places in 434 ms of which 1 ms to minimize.
[2021-05-14 22:35:00] [INFO ] Deduced a trap composed of 12 places in 449 ms of which 0 ms to minimize.
[2021-05-14 22:35:00] [INFO ] Deduced a trap composed of 30 places in 434 ms of which 1 ms to minimize.
[2021-05-14 22:35:01] [INFO ] Deduced a trap composed of 124 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:35:01] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:35:02] [INFO ] Deduced a trap composed of 24 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:35:02] [INFO ] Deduced a trap composed of 99 places in 452 ms of which 1 ms to minimize.
[2021-05-14 22:35:03] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 1 ms to minimize.
[2021-05-14 22:35:03] [INFO ] Deduced a trap composed of 82 places in 453 ms of which 10 ms to minimize.
[2021-05-14 22:35:04] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 0 ms to minimize.
[2021-05-14 22:35:04] [INFO ] Deduced a trap composed of 17 places in 444 ms of which 1 ms to minimize.
[2021-05-14 22:35:05] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 1 ms to minimize.
[2021-05-14 22:35:05] [INFO ] Deduced a trap composed of 108 places in 373 ms of which 1 ms to minimize.
[2021-05-14 22:35:06] [INFO ] Deduced a trap composed of 104 places in 372 ms of which 1 ms to minimize.
[2021-05-14 22:35:06] [INFO ] Deduced a trap composed of 110 places in 371 ms of which 1 ms to minimize.
[2021-05-14 22:35:06] [INFO ] Deduced a trap composed of 158 places in 399 ms of which 1 ms to minimize.
[2021-05-14 22:35:07] [INFO ] Deduced a trap composed of 102 places in 386 ms of which 1 ms to minimize.
[2021-05-14 22:35:07] [INFO ] Deduced a trap composed of 121 places in 436 ms of which 1 ms to minimize.
[2021-05-14 22:35:08] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:35:08] [INFO ] Deduced a trap composed of 146 places in 430 ms of which 0 ms to minimize.
[2021-05-14 22:35:09] [INFO ] Deduced a trap composed of 32 places in 434 ms of which 1 ms to minimize.
[2021-05-14 22:35:09] [INFO ] Deduced a trap composed of 121 places in 428 ms of which 1 ms to minimize.
[2021-05-14 22:35:10] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 1 ms to minimize.
[2021-05-14 22:35:10] [INFO ] Deduced a trap composed of 114 places in 432 ms of which 1 ms to minimize.
[2021-05-14 22:35:11] [INFO ] Deduced a trap composed of 119 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:35:11] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 1 ms to minimize.
[2021-05-14 22:35:12] [INFO ] Deduced a trap composed of 130 places in 445 ms of which 1 ms to minimize.
[2021-05-14 22:35:12] [INFO ] Deduced a trap composed of 50 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:35:13] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:35:13] [INFO ] Deduced a trap composed of 12 places in 417 ms of which 1 ms to minimize.
[2021-05-14 22:35:14] [INFO ] Deduced a trap composed of 16 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:35:14] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 0 ms to minimize.
[2021-05-14 22:35:15] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 0 ms to minimize.
[2021-05-14 22:35:15] [INFO ] Deduced a trap composed of 135 places in 349 ms of which 1 ms to minimize.
[2021-05-14 22:35:16] [INFO ] Deduced a trap composed of 107 places in 344 ms of which 1 ms to minimize.
[2021-05-14 22:35:16] [INFO ] Deduced a trap composed of 133 places in 347 ms of which 1 ms to minimize.
[2021-05-14 22:35:16] [INFO ] Deduced a trap composed of 103 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:35:17] [INFO ] Deduced a trap composed of 111 places in 395 ms of which 0 ms to minimize.
[2021-05-14 22:35:17] [INFO ] Deduced a trap composed of 141 places in 348 ms of which 1 ms to minimize.
[2021-05-14 22:35:18] [INFO ] Deduced a trap composed of 135 places in 358 ms of which 1 ms to minimize.
[2021-05-14 22:35:18] [INFO ] Deduced a trap composed of 189 places in 370 ms of which 0 ms to minimize.
[2021-05-14 22:35:19] [INFO ] Deduced a trap composed of 64 places in 380 ms of which 1 ms to minimize.
[2021-05-14 22:35:19] [INFO ] Deduced a trap composed of 44 places in 378 ms of which 1 ms to minimize.
[2021-05-14 22:35:19] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 1 ms to minimize.
[2021-05-14 22:35:20] [INFO ] Deduced a trap composed of 84 places in 350 ms of which 0 ms to minimize.
[2021-05-14 22:35:20] [INFO ] Deduced a trap composed of 80 places in 351 ms of which 1 ms to minimize.
[2021-05-14 22:35:21] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 1 ms to minimize.
[2021-05-14 22:35:21] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 0 ms to minimize.
[2021-05-14 22:35:21] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 1 ms to minimize.
[2021-05-14 22:35:22] [INFO ] Deduced a trap composed of 54 places in 378 ms of which 1 ms to minimize.
[2021-05-14 22:35:22] [INFO ] Deduced a trap composed of 138 places in 340 ms of which 1 ms to minimize.
[2021-05-14 22:35:23] [INFO ] Deduced a trap composed of 138 places in 339 ms of which 0 ms to minimize.
[2021-05-14 22:35:23] [INFO ] Deduced a trap composed of 98 places in 341 ms of which 1 ms to minimize.
[2021-05-14 22:35:24] [INFO ] Deduced a trap composed of 115 places in 293 ms of which 1 ms to minimize.
[2021-05-14 22:35:24] [INFO ] Deduced a trap composed of 115 places in 293 ms of which 1 ms to minimize.
[2021-05-14 22:35:24] [INFO ] Deduced a trap composed of 115 places in 301 ms of which 1 ms to minimize.
[2021-05-14 22:35:25] [INFO ] Deduced a trap composed of 115 places in 304 ms of which 1 ms to minimize.
[2021-05-14 22:35:25] [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 22:35:25] [INFO ] [Real]Absence check using 23 positive place invariants in 47 ms returned sat
[2021-05-14 22:35:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 25 ms returned sat
[2021-05-14 22:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:35:31] [INFO ] [Real]Absence check using state equation in 5865 ms returned sat
[2021-05-14 22:35:31] [INFO ] [Real]Added 546 Read/Feed constraints in 91 ms returned sat
[2021-05-14 22:35:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:35:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2021-05-14 22:35:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 28 ms returned sat
[2021-05-14 22:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:35:37] [INFO ] [Nat]Absence check using state equation in 5475 ms returned sat
[2021-05-14 22:35:37] [INFO ] [Nat]Added 546 Read/Feed constraints in 106 ms returned sat
[2021-05-14 22:35:37] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 0 ms to minimize.
[2021-05-14 22:35:38] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 1 ms to minimize.
[2021-05-14 22:35:38] [INFO ] Deduced a trap composed of 28 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:35:39] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:35:39] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 1 ms to minimize.
[2021-05-14 22:35:40] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:35:40] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:35:41] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:35:41] [INFO ] Deduced a trap composed of 14 places in 435 ms of which 0 ms to minimize.
[2021-05-14 22:35:42] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 1 ms to minimize.
[2021-05-14 22:35:42] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 1 ms to minimize.
[2021-05-14 22:35:43] [INFO ] Deduced a trap composed of 74 places in 424 ms of which 1 ms to minimize.
[2021-05-14 22:35:43] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 0 ms to minimize.
[2021-05-14 22:35:44] [INFO ] Deduced a trap composed of 40 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:35:45] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:35:45] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:35:46] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:35:46] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 0 ms to minimize.
[2021-05-14 22:35:47] [INFO ] Deduced a trap composed of 34 places in 433 ms of which 1 ms to minimize.
[2021-05-14 22:35:47] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 0 ms to minimize.
[2021-05-14 22:35:48] [INFO ] Deduced a trap composed of 48 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:35:48] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 0 ms to minimize.
[2021-05-14 22:35:48] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:35:49] [INFO ] Deduced a trap composed of 62 places in 435 ms of which 1 ms to minimize.
[2021-05-14 22:35:49] [INFO ] Deduced a trap composed of 48 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:35:50] [INFO ] Deduced a trap composed of 48 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:35:50] [INFO ] Deduced a trap composed of 48 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:35:51] [INFO ] Deduced a trap composed of 12 places in 410 ms of which 0 ms to minimize.
[2021-05-14 22:35:51] [INFO ] Deduced a trap composed of 40 places in 401 ms of which 1 ms to minimize.
[2021-05-14 22:35:52] [INFO ] Deduced a trap composed of 24 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:35:52] [INFO ] Deduced a trap composed of 34 places in 395 ms of which 1 ms to minimize.
[2021-05-14 22:35:53] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 1 ms to minimize.
[2021-05-14 22:35:53] [INFO ] Deduced a trap composed of 24 places in 387 ms of which 1 ms to minimize.
[2021-05-14 22:35:54] [INFO ] Deduced a trap composed of 30 places in 376 ms of which 1 ms to minimize.
[2021-05-14 22:35:54] [INFO ] Deduced a trap composed of 36 places in 377 ms of which 0 ms to minimize.
[2021-05-14 22:35:55] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 0 ms to minimize.
[2021-05-14 22:35:55] [INFO ] Deduced a trap composed of 32 places in 387 ms of which 1 ms to minimize.
[2021-05-14 22:35:56] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 1 ms to minimize.
[2021-05-14 22:35:56] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 1 ms to minimize.
[2021-05-14 22:35:56] [INFO ] Deduced a trap composed of 68 places in 308 ms of which 1 ms to minimize.
[2021-05-14 22:35:57] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 1 ms to minimize.
[2021-05-14 22:35:57] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 1 ms to minimize.
[2021-05-14 22:35:58] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 0 ms to minimize.
[2021-05-14 22:35:58] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 1 ms to minimize.
[2021-05-14 22:35:58] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 0 ms to minimize.
[2021-05-14 22:35:59] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 1 ms to minimize.
[2021-05-14 22:35:59] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 1 ms to minimize.
[2021-05-14 22:36:00] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 1 ms to minimize.
[2021-05-14 22:36:00] [INFO ] Deduced a trap composed of 76 places in 277 ms of which 0 ms to minimize.
[2021-05-14 22:36:00] [INFO ] Deduced a trap composed of 108 places in 274 ms of which 0 ms to minimize.
[2021-05-14 22:36:01] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 1 ms to minimize.
[2021-05-14 22:36:01] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 23767 ms
[2021-05-14 22:36:01] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 116 ms.
[2021-05-14 22:36:16] [INFO ] Added : 705 causal constraints over 141 iterations in 15195 ms. Result :unknown
[2021-05-14 22:36:16] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:36:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:36:17] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-14 22:36:17] [INFO ] [Real]Added 546 Read/Feed constraints in 71 ms returned sat
[2021-05-14 22:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:36:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:36:17] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:36:17] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2021-05-14 22:36:17] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2021-05-14 22:36:18] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:36:18] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 0 ms to minimize.
[2021-05-14 22:36:19] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 0 ms to minimize.
[2021-05-14 22:36:19] [INFO ] Deduced a trap composed of 44 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:36:20] [INFO ] Deduced a trap composed of 38 places in 424 ms of which 1 ms to minimize.
[2021-05-14 22:36:27] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 1 ms to minimize.
[2021-05-14 22:36:28] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:36:28] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 0 ms to minimize.
[2021-05-14 22:36:29] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:36:29] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:36:30] [INFO ] Deduced a trap composed of 22 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:36:30] [INFO ] Deduced a trap composed of 70 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:36:31] [INFO ] Deduced a trap composed of 75 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:36:31] [INFO ] Deduced a trap composed of 79 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:36:32] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 0 ms to minimize.
[2021-05-14 22:36:32] [INFO ] Deduced a trap composed of 50 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:36:33] [INFO ] Deduced a trap composed of 79 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:36:33] [INFO ] Deduced a trap composed of 64 places in 405 ms of which 0 ms to minimize.
[2021-05-14 22:36:33] [INFO ] Deduced a trap composed of 60 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:36:34] [INFO ] Deduced a trap composed of 64 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:36:34] [INFO ] Deduced a trap composed of 60 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:36:35] [INFO ] Deduced a trap composed of 16 places in 452 ms of which 0 ms to minimize.
[2021-05-14 22:36:35] [INFO ] Deduced a trap composed of 20 places in 446 ms of which 1 ms to minimize.
[2021-05-14 22:36:36] [INFO ] Deduced a trap composed of 56 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:36:36] [INFO ] Deduced a trap composed of 56 places in 441 ms of which 0 ms to minimize.
[2021-05-14 22:36:37] [INFO ] Deduced a trap composed of 56 places in 416 ms of which 1 ms to minimize.
[2021-05-14 22:36:37] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:36:38] [INFO ] Deduced a trap composed of 56 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:36:38] [INFO ] Deduced a trap composed of 66 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:36:39] [INFO ] Deduced a trap composed of 82 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:36:39] [INFO ] Deduced a trap composed of 56 places in 424 ms of which 1 ms to minimize.
[2021-05-14 22:36:40] [INFO ] Deduced a trap composed of 262 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:36:40] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 1 ms to minimize.
[2021-05-14 22:36:41] [INFO ] Deduced a trap composed of 92 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:36:41] [INFO ] Deduced a trap composed of 58 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:36:42] [INFO ] Deduced a trap composed of 92 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:36:42] [INFO ] Deduced a trap composed of 78 places in 418 ms of which 0 ms to minimize.
[2021-05-14 22:36:43] [INFO ] Deduced a trap composed of 74 places in 420 ms of which 0 ms to minimize.
[2021-05-14 22:36:43] [INFO ] Deduced a trap composed of 92 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:36:44] [INFO ] Deduced a trap composed of 56 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:36:44] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:36:45] [INFO ] Deduced a trap composed of 58 places in 415 ms of which 1 ms to minimize.
[2021-05-14 22:36:45] [INFO ] Deduced a trap composed of 130 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:36:45] [INFO ] Deduced a trap composed of 52 places in 415 ms of which 1 ms to minimize.
[2021-05-14 22:36:46] [INFO ] Deduced a trap composed of 56 places in 244 ms of which 1 ms to minimize.
[2021-05-14 22:36:46] [INFO ] Deduced a trap composed of 110 places in 399 ms of which 1 ms to minimize.
[2021-05-14 22:36:47] [INFO ] Deduced a trap composed of 94 places in 400 ms of which 1 ms to minimize.
[2021-05-14 22:36:47] [INFO ] Deduced a trap composed of 94 places in 398 ms of which 1 ms to minimize.
[2021-05-14 22:36:48] [INFO ] Deduced a trap composed of 110 places in 399 ms of which 1 ms to minimize.
[2021-05-14 22:36:48] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 0 ms to minimize.
[2021-05-14 22:36:49] [INFO ] Deduced a trap composed of 76 places in 402 ms of which 1 ms to minimize.
[2021-05-14 22:36:49] [INFO ] Deduced a trap composed of 110 places in 400 ms of which 1 ms to minimize.
[2021-05-14 22:36:49] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 1 ms to minimize.
[2021-05-14 22:36:50] [INFO ] Deduced a trap composed of 32 places in 396 ms of which 1 ms to minimize.
[2021-05-14 22:36:50] [INFO ] Deduced a trap composed of 36 places in 390 ms of which 0 ms to minimize.
[2021-05-14 22:36:51] [INFO ] Deduced a trap composed of 40 places in 391 ms of which 0 ms to minimize.
[2021-05-14 22:36:51] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 1 ms to minimize.
[2021-05-14 22:36:51] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 33696 ms
[2021-05-14 22:36:51] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 100 ms.
[2021-05-14 22:37:02] [INFO ] Deduced a trap composed of 2 places in 494 ms of which 1 ms to minimize.
[2021-05-14 22:37:02] [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 22:37:02] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:37:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:37:03] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2021-05-14 22:37:03] [INFO ] [Real]Added 546 Read/Feed constraints in 64 ms returned sat
[2021-05-14 22:37:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:37:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:37:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:37:04] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2021-05-14 22:37:04] [INFO ] [Nat]Added 546 Read/Feed constraints in 77 ms returned sat
[2021-05-14 22:37:04] [INFO ] Deduced a trap composed of 130 places in 413 ms of which 1 ms to minimize.
[2021-05-14 22:37:04] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 1 ms to minimize.
[2021-05-14 22:37:05] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2021-05-14 22:37:05] [INFO ] Deduced a trap composed of 21 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:37:06] [INFO ] Deduced a trap composed of 30 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:37:06] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:37:07] [INFO ] Deduced a trap composed of 46 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:37:07] [INFO ] Deduced a trap composed of 50 places in 416 ms of which 1 ms to minimize.
[2021-05-14 22:37:08] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:37:08] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:37:09] [INFO ] Deduced a trap composed of 20 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:37:09] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 1 ms to minimize.
[2021-05-14 22:37:10] [INFO ] Deduced a trap composed of 62 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:37:10] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 1 ms to minimize.
[2021-05-14 22:37:10] [INFO ] Deduced a trap composed of 102 places in 370 ms of which 1 ms to minimize.
[2021-05-14 22:37:11] [INFO ] Deduced a trap composed of 102 places in 371 ms of which 1 ms to minimize.
[2021-05-14 22:37:11] [INFO ] Deduced a trap composed of 48 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:37:12] [INFO ] Deduced a trap composed of 58 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:37:12] [INFO ] Deduced a trap composed of 48 places in 399 ms of which 1 ms to minimize.
[2021-05-14 22:37:13] [INFO ] Deduced a trap composed of 58 places in 397 ms of which 1 ms to minimize.
[2021-05-14 22:37:13] [INFO ] Deduced a trap composed of 48 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:37:14] [INFO ] Deduced a trap composed of 48 places in 440 ms of which 1 ms to minimize.
[2021-05-14 22:37:14] [INFO ] Deduced a trap composed of 58 places in 394 ms of which 2 ms to minimize.
[2021-05-14 22:37:14] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:37:15] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 0 ms to minimize.
[2021-05-14 22:37:15] [INFO ] Deduced a trap composed of 94 places in 394 ms of which 1 ms to minimize.
[2021-05-14 22:37:16] [INFO ] Deduced a trap composed of 56 places in 394 ms of which 1 ms to minimize.
[2021-05-14 22:37:16] [INFO ] Deduced a trap composed of 74 places in 393 ms of which 1 ms to minimize.
[2021-05-14 22:37:17] [INFO ] Deduced a trap composed of 108 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:37:17] [INFO ] Deduced a trap composed of 165 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:37:18] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 3 ms to minimize.
[2021-05-14 22:37:18] [INFO ] Deduced a trap composed of 38 places in 382 ms of which 1 ms to minimize.
[2021-05-14 22:37:18] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 1 ms to minimize.
[2021-05-14 22:37:19] [INFO ] Deduced a trap composed of 38 places in 388 ms of which 1 ms to minimize.
[2021-05-14 22:37:19] [INFO ] Deduced a trap composed of 84 places in 332 ms of which 1 ms to minimize.
[2021-05-14 22:37:20] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 0 ms to minimize.
[2021-05-14 22:37:20] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 0 ms to minimize.
[2021-05-14 22:37:21] [INFO ] Deduced a trap composed of 84 places in 334 ms of which 1 ms to minimize.
[2021-05-14 22:37:21] [INFO ] Deduced a trap composed of 102 places in 337 ms of which 0 ms to minimize.
[2021-05-14 22:37:21] [INFO ] Deduced a trap composed of 120 places in 337 ms of which 1 ms to minimize.
[2021-05-14 22:37:22] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 1 ms to minimize.
[2021-05-14 22:37:22] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 0 ms to minimize.
[2021-05-14 22:37:22] [INFO ] Deduced a trap composed of 84 places in 334 ms of which 1 ms to minimize.
[2021-05-14 22:37:23] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 0 ms to minimize.
[2021-05-14 22:37:23] [INFO ] Deduced a trap composed of 66 places in 318 ms of which 1 ms to minimize.
[2021-05-14 22:37:25] [INFO ] Deduced a trap composed of 66 places in 1323 ms of which 1 ms to minimize.
[2021-05-14 22:37:25] [INFO ] Deduced a trap composed of 76 places in 323 ms of which 0 ms to minimize.
[2021-05-14 22:37:25] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 0 ms to minimize.
[2021-05-14 22:37:26] [INFO ] Deduced a trap composed of 104 places in 320 ms of which 1 ms to minimize.
[2021-05-14 22:37:26] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 0 ms to minimize.
[2021-05-14 22:37:27] [INFO ] Deduced a trap composed of 16 places in 384 ms of which 1 ms to minimize.
[2021-05-14 22:37:27] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2021-05-14 22:37:27] [INFO ] Deduced a trap composed of 116 places in 247 ms of which 1 ms to minimize.
[2021-05-14 22:37:28] [INFO ] Deduced a trap composed of 104 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:37:28] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 0 ms to minimize.
[2021-05-14 22:37:28] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2021-05-14 22:37:28] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 1 ms to minimize.
[2021-05-14 22:37:29] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 0 ms to minimize.
[2021-05-14 22:37:29] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 25123 ms
[2021-05-14 22:37:29] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 98 ms.
[2021-05-14 22:37:49] [INFO ] Deduced a trap composed of 2 places in 517 ms of which 1 ms to minimize.
[2021-05-14 22:37:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 22:37:49] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:37:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:37:49] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2021-05-14 22:37:49] [INFO ] [Real]Added 546 Read/Feed constraints in 74 ms returned sat
[2021-05-14 22:37:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:37:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:37:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:37:50] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2021-05-14 22:37:50] [INFO ] [Nat]Added 546 Read/Feed constraints in 85 ms returned sat
[2021-05-14 22:37:50] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:37:51] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 1 ms to minimize.
[2021-05-14 22:37:51] [INFO ] Deduced a trap composed of 16 places in 431 ms of which 0 ms to minimize.
[2021-05-14 22:37:52] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 1 ms to minimize.
[2021-05-14 22:37:52] [INFO ] Deduced a trap composed of 12 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:37:53] [INFO ] Deduced a trap composed of 19 places in 427 ms of which 0 ms to minimize.
[2021-05-14 22:37:53] [INFO ] Deduced a trap composed of 16 places in 430 ms of which 1 ms to minimize.
[2021-05-14 22:37:54] [INFO ] Deduced a trap composed of 60 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:37:54] [INFO ] Deduced a trap composed of 44 places in 436 ms of which 1 ms to minimize.
[2021-05-14 22:37:55] [INFO ] Deduced a trap composed of 44 places in 427 ms of which 1 ms to minimize.
[2021-05-14 22:37:55] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 1 ms to minimize.
[2021-05-14 22:37:56] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 1 ms to minimize.
[2021-05-14 22:37:56] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 1 ms to minimize.
[2021-05-14 22:37:57] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:37:57] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:37:58] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 0 ms to minimize.
[2021-05-14 22:37:58] [INFO ] Deduced a trap composed of 58 places in 437 ms of which 1 ms to minimize.
[2021-05-14 22:37:59] [INFO ] Deduced a trap composed of 56 places in 431 ms of which 0 ms to minimize.
[2021-05-14 22:37:59] [INFO ] Deduced a trap composed of 12 places in 430 ms of which 1 ms to minimize.
[2021-05-14 22:38:00] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 0 ms to minimize.
[2021-05-14 22:38:00] [INFO ] Deduced a trap composed of 68 places in 417 ms of which 1 ms to minimize.
[2021-05-14 22:38:01] [INFO ] Deduced a trap composed of 44 places in 408 ms of which 1 ms to minimize.
[2021-05-14 22:38:01] [INFO ] Deduced a trap composed of 44 places in 410 ms of which 1 ms to minimize.
[2021-05-14 22:38:02] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:38:02] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 1 ms to minimize.
[2021-05-14 22:38:03] [INFO ] Deduced a trap composed of 32 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:38:03] [INFO ] Deduced a trap composed of 32 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:38:03] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:38:04] [INFO ] Deduced a trap composed of 30 places in 390 ms of which 0 ms to minimize.
[2021-05-14 22:38:04] [INFO ] Deduced a trap composed of 30 places in 387 ms of which 1 ms to minimize.
[2021-05-14 22:38:05] [INFO ] Deduced a trap composed of 30 places in 399 ms of which 1 ms to minimize.
[2021-05-14 22:38:05] [INFO ] Deduced a trap composed of 30 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:06] [INFO ] Deduced a trap composed of 116 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:38:06] [INFO ] Deduced a trap composed of 52 places in 300 ms of which 1 ms to minimize.
[2021-05-14 22:38:06] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 0 ms to minimize.
[2021-05-14 22:38:07] [INFO ] Deduced a trap composed of 56 places in 290 ms of which 0 ms to minimize.
[2021-05-14 22:38:07] [INFO ] Deduced a trap composed of 88 places in 290 ms of which 0 ms to minimize.
[2021-05-14 22:38:08] [INFO ] Deduced a trap composed of 116 places in 359 ms of which 1 ms to minimize.
[2021-05-14 22:38:08] [INFO ] Deduced a trap composed of 116 places in 358 ms of which 1 ms to minimize.
[2021-05-14 22:38:08] [INFO ] Deduced a trap composed of 116 places in 360 ms of which 1 ms to minimize.
[2021-05-14 22:38:09] [INFO ] Deduced a trap composed of 116 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:38:09] [INFO ] Deduced a trap composed of 122 places in 357 ms of which 1 ms to minimize.
[2021-05-14 22:38:10] [INFO ] Deduced a trap composed of 88 places in 290 ms of which 1 ms to minimize.
[2021-05-14 22:38:10] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 0 ms to minimize.
[2021-05-14 22:38:10] [INFO ] Deduced a trap composed of 86 places in 298 ms of which 1 ms to minimize.
[2021-05-14 22:38:11] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 1 ms to minimize.
[2021-05-14 22:38:11] [INFO ] Deduced a trap composed of 92 places in 292 ms of which 1 ms to minimize.
[2021-05-14 22:38:11] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 1 ms to minimize.
[2021-05-14 22:38:12] [INFO ] Deduced a trap composed of 86 places in 294 ms of which 1 ms to minimize.
[2021-05-14 22:38:12] [INFO ] Deduced a trap composed of 37 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:38:13] [INFO ] Deduced a trap composed of 32 places in 420 ms of which 0 ms to minimize.
[2021-05-14 22:38:13] [INFO ] Deduced a trap composed of 48 places in 384 ms of which 1 ms to minimize.
[2021-05-14 22:38:14] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 1 ms to minimize.
[2021-05-14 22:38:14] [INFO ] Deduced a trap composed of 58 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:14] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 0 ms to minimize.
[2021-05-14 22:38:15] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 1 ms to minimize.
[2021-05-14 22:38:15] [INFO ] Deduced a trap composed of 92 places in 357 ms of which 1 ms to minimize.
[2021-05-14 22:38:16] [INFO ] Deduced a trap composed of 124 places in 362 ms of which 1 ms to minimize.
[2021-05-14 22:38:16] [INFO ] Deduced a trap composed of 102 places in 330 ms of which 0 ms to minimize.
[2021-05-14 22:38:16] [INFO ] Deduced a trap composed of 84 places in 319 ms of which 1 ms to minimize.
[2021-05-14 22:38:17] [INFO ] Deduced a trap composed of 130 places in 315 ms of which 1 ms to minimize.
[2021-05-14 22:38:17] [INFO ] Deduced a trap composed of 70 places in 306 ms of which 1 ms to minimize.
[2021-05-14 22:38:18] [INFO ] Deduced a trap composed of 81 places in 301 ms of which 1 ms to minimize.
[2021-05-14 22:38:18] [INFO ] Deduced a trap composed of 81 places in 300 ms of which 1 ms to minimize.
[2021-05-14 22:38:18] [INFO ] Deduced a trap composed of 81 places in 300 ms of which 1 ms to minimize.
[2021-05-14 22:38:19] [INFO ] Deduced a trap composed of 81 places in 302 ms of which 1 ms to minimize.
[2021-05-14 22:38:19] [INFO ] Deduced a trap composed of 74 places in 308 ms of which 0 ms to minimize.
[2021-05-14 22:38:19] [INFO ] Deduced a trap composed of 81 places in 298 ms of which 0 ms to minimize.
[2021-05-14 22:38:19] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 29506 ms
[2021-05-14 22:38:20] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 106 ms.
[2021-05-14 22:38:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-14 22:38:34] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:38:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:38:35] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-14 22:38:35] [INFO ] [Real]Added 546 Read/Feed constraints in 72 ms returned sat
[2021-05-14 22:38:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:38:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:38:35] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:38:36] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2021-05-14 22:38:36] [INFO ] [Nat]Added 546 Read/Feed constraints in 81 ms returned sat
[2021-05-14 22:38:36] [INFO ] Deduced a trap composed of 43 places in 365 ms of which 1 ms to minimize.
[2021-05-14 22:38:37] [INFO ] Deduced a trap composed of 62 places in 358 ms of which 0 ms to minimize.
[2021-05-14 22:38:37] [INFO ] Deduced a trap composed of 62 places in 379 ms of which 1 ms to minimize.
[2021-05-14 22:38:37] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 0 ms to minimize.
[2021-05-14 22:38:38] [INFO ] Deduced a trap composed of 62 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:38:38] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 0 ms to minimize.
[2021-05-14 22:38:39] [INFO ] Deduced a trap composed of 92 places in 369 ms of which 1 ms to minimize.
[2021-05-14 22:38:39] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 0 ms to minimize.
[2021-05-14 22:38:40] [INFO ] Deduced a trap composed of 16 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:38:40] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 1 ms to minimize.
[2021-05-14 22:38:40] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:38:41] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 1 ms to minimize.
[2021-05-14 22:38:41] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 1 ms to minimize.
[2021-05-14 22:38:42] [INFO ] Deduced a trap composed of 62 places in 370 ms of which 0 ms to minimize.
[2021-05-14 22:38:42] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 1 ms to minimize.
[2021-05-14 22:38:43] [INFO ] Deduced a trap composed of 198 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:38:43] [INFO ] Deduced a trap composed of 205 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:38:44] [INFO ] Deduced a trap composed of 156 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:38:44] [INFO ] Deduced a trap composed of 154 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:38:44] [INFO ] Deduced a trap composed of 176 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:38:45] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 0 ms to minimize.
[2021-05-14 22:38:45] [INFO ] Deduced a trap composed of 62 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:38:46] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:38:46] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:38:47] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:38:47] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:38:48] [INFO ] Deduced a trap composed of 74 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:38:48] [INFO ] Deduced a trap composed of 74 places in 408 ms of which 1 ms to minimize.
[2021-05-14 22:38:49] [INFO ] Deduced a trap composed of 62 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:38:49] [INFO ] Deduced a trap composed of 14 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:38:50] [INFO ] Deduced a trap composed of 65 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:38:50] [INFO ] Deduced a trap composed of 70 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:50] [INFO ] Deduced a trap composed of 65 places in 394 ms of which 1 ms to minimize.
[2021-05-14 22:38:51] [INFO ] Deduced a trap composed of 87 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:38:51] [INFO ] Deduced a trap composed of 87 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:52] [INFO ] Deduced a trap composed of 102 places in 393 ms of which 1 ms to minimize.
[2021-05-14 22:38:52] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 1 ms to minimize.
[2021-05-14 22:38:53] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 0 ms to minimize.
[2021-05-14 22:38:53] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 1 ms to minimize.
[2021-05-14 22:38:54] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:54] [INFO ] Deduced a trap composed of 82 places in 391 ms of which 0 ms to minimize.
[2021-05-14 22:38:55] [INFO ] Deduced a trap composed of 100 places in 392 ms of which 0 ms to minimize.
[2021-05-14 22:38:55] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:38:56] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 0 ms to minimize.
[2021-05-14 22:38:56] [INFO ] Deduced a trap composed of 40 places in 433 ms of which 1 ms to minimize.
[2021-05-14 22:38:57] [INFO ] Deduced a trap composed of 32 places in 430 ms of which 0 ms to minimize.
[2021-05-14 22:38:57] [INFO ] Deduced a trap composed of 32 places in 432 ms of which 0 ms to minimize.
[2021-05-14 22:38:58] [INFO ] Deduced a trap composed of 32 places in 434 ms of which 1 ms to minimize.
[2021-05-14 22:38:58] [INFO ] Deduced a trap composed of 92 places in 432 ms of which 1 ms to minimize.
[2021-05-14 22:38:59] [INFO ] Deduced a trap composed of 50 places in 435 ms of which 1 ms to minimize.
[2021-05-14 22:38:59] [INFO ] Deduced a trap composed of 12 places in 440 ms of which 1 ms to minimize.
[2021-05-14 22:39:00] [INFO ] Deduced a trap composed of 12 places in 433 ms of which 1 ms to minimize.
[2021-05-14 22:39:00] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:39:00] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 0 ms to minimize.
[2021-05-14 22:39:01] [INFO ] Deduced a trap composed of 74 places in 370 ms of which 1 ms to minimize.
[2021-05-14 22:39:01] [INFO ] Deduced a trap composed of 68 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:39:02] [INFO ] Deduced a trap composed of 122 places in 370 ms of which 1 ms to minimize.
[2021-05-14 22:39:02] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 1 ms to minimize.
[2021-05-14 22:39:02] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 1 ms to minimize.
[2021-05-14 22:39:03] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 1 ms to minimize.
[2021-05-14 22:39:03] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 1 ms to minimize.
[2021-05-14 22:39:04] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 1 ms to minimize.
[2021-05-14 22:39:04] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 1 ms to minimize.
[2021-05-14 22:39:04] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 1 ms to minimize.
[2021-05-14 22:39:05] [INFO ] Deduced a trap composed of 54 places in 327 ms of which 1 ms to minimize.
[2021-05-14 22:39:05] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 1 ms to minimize.
[2021-05-14 22:39:12] [INFO ] Deduced a trap composed of 54 places in 7308 ms of which 0 ms to minimize.
[2021-05-14 22:39:13] [INFO ] Deduced a trap composed of 54 places in 327 ms of which 1 ms to minimize.
[2021-05-14 22:39:13] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 1 ms to minimize.
[2021-05-14 22:39:14] [INFO ] Deduced a trap composed of 98 places in 322 ms of which 0 ms to minimize.
[2021-05-14 22:39:14] [INFO ] Deduced a trap composed of 104 places in 321 ms of which 0 ms to minimize.
[2021-05-14 22:39:14] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 0 ms to minimize.
[2021-05-14 22:39:15] [INFO ] Deduced a trap composed of 80 places in 260 ms of which 0 ms to minimize.
[2021-05-14 22:39:15] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 0 ms to minimize.
[2021-05-14 22:39:15] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 1 ms to minimize.
[2021-05-14 22:39:16] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 0 ms to minimize.
[2021-05-14 22:39:16] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 0 ms to minimize.
[2021-05-14 22:39:17] [INFO ] Deduced a trap composed of 94 places in 294 ms of which 0 ms to minimize.
[2021-05-14 22:39:17] [INFO ] Deduced a trap composed of 96 places in 302 ms of which 1 ms to minimize.
[2021-05-14 22:39:17] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 0 ms to minimize.
[2021-05-14 22:39:18] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2021-05-14 22:39:18] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 1 ms to minimize.
[2021-05-14 22:39:18] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:39:19] [INFO ] Deduced a trap composed of 127 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:39:19] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 42859 ms
[2021-05-14 22:39:19] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 98 ms.
[2021-05-14 22:39:21] [INFO ] Deduced a trap composed of 2 places in 498 ms of which 1 ms to minimize.
[2021-05-14 22:39:21] [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
[2021-05-14 22:39:21] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2021-05-14 22:39:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:39:21] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2021-05-14 22:39:21] [INFO ] [Real]Added 546 Read/Feed constraints in 78 ms returned sat
[2021-05-14 22:39:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:39:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:39:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:39:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:39:22] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2021-05-14 22:39:22] [INFO ] [Nat]Added 546 Read/Feed constraints in 82 ms returned sat
[2021-05-14 22:39:23] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:39:23] [INFO ] Deduced a trap composed of 18 places in 382 ms of which 1 ms to minimize.
[2021-05-14 22:39:24] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 1 ms to minimize.
[2021-05-14 22:39:24] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 1 ms to minimize.
[2021-05-14 22:39:24] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 1 ms to minimize.
[2021-05-14 22:39:25] [INFO ] Deduced a trap composed of 62 places in 362 ms of which 1 ms to minimize.
[2021-05-14 22:39:25] [INFO ] Deduced a trap composed of 46 places in 356 ms of which 1 ms to minimize.
[2021-05-14 22:39:26] [INFO ] Deduced a trap composed of 46 places in 358 ms of which 1 ms to minimize.
[2021-05-14 22:39:26] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 0 ms to minimize.
[2021-05-14 22:39:26] [INFO ] Deduced a trap composed of 30 places in 360 ms of which 1 ms to minimize.
[2021-05-14 22:39:27] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 1 ms to minimize.
[2021-05-14 22:39:27] [INFO ] Deduced a trap composed of 66 places in 356 ms of which 1 ms to minimize.
[2021-05-14 22:39:28] [INFO ] Deduced a trap composed of 66 places in 354 ms of which 1 ms to minimize.
[2021-05-14 22:39:28] [INFO ] Deduced a trap composed of 66 places in 354 ms of which 1 ms to minimize.
[2021-05-14 22:39:29] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 1 ms to minimize.
[2021-05-14 22:39:29] [INFO ] Deduced a trap composed of 22 places in 357 ms of which 1 ms to minimize.
[2021-05-14 22:39:29] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 0 ms to minimize.
[2021-05-14 22:39:30] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 0 ms to minimize.
[2021-05-14 22:39:30] [INFO ] Deduced a trap composed of 58 places in 358 ms of which 1 ms to minimize.
[2021-05-14 22:39:31] [INFO ] Deduced a trap composed of 198 places in 359 ms of which 0 ms to minimize.
[2021-05-14 22:39:31] [INFO ] Deduced a trap composed of 24 places in 350 ms of which 1 ms to minimize.
[2021-05-14 22:39:31] [INFO ] Deduced a trap composed of 66 places in 305 ms of which 1 ms to minimize.
[2021-05-14 22:39:32] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 1 ms to minimize.
[2021-05-14 22:39:32] [INFO ] Deduced a trap composed of 56 places in 273 ms of which 0 ms to minimize.
[2021-05-14 22:39:32] [INFO ] Deduced a trap composed of 43 places in 344 ms of which 1 ms to minimize.
[2021-05-14 22:39:33] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 1 ms to minimize.
[2021-05-14 22:39:33] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2021-05-14 22:39:34] [INFO ] Deduced a trap composed of 66 places in 287 ms of which 1 ms to minimize.
[2021-05-14 22:39:34] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:39:34] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 1 ms to minimize.
[2021-05-14 22:39:35] [INFO ] Deduced a trap composed of 94 places in 283 ms of which 0 ms to minimize.
[2021-05-14 22:39:35] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 1 ms to minimize.
[2021-05-14 22:39:35] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 1 ms to minimize.
[2021-05-14 22:39:36] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 0 ms to minimize.
[2021-05-14 22:39:36] [INFO ] Deduced a trap composed of 80 places in 233 ms of which 1 ms to minimize.
[2021-05-14 22:39:36] [INFO ] Deduced a trap composed of 80 places in 237 ms of which 1 ms to minimize.
[2021-05-14 22:39:36] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 1 ms to minimize.
[2021-05-14 22:39:37] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 1 ms to minimize.
[2021-05-14 22:39:37] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 1 ms to minimize.
[2021-05-14 22:39:38] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2021-05-14 22:39:38] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 0 ms to minimize.
[2021-05-14 22:39:38] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 0 ms to minimize.
[2021-05-14 22:39:39] [INFO ] Deduced a trap composed of 62 places in 267 ms of which 1 ms to minimize.
[2021-05-14 22:39:39] [INFO ] Deduced a trap composed of 62 places in 267 ms of which 0 ms to minimize.
[2021-05-14 22:39:39] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 1 ms to minimize.
[2021-05-14 22:39:40] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 1 ms to minimize.
[2021-05-14 22:39:40] [INFO ] Deduced a trap composed of 95 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:39:41] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 1 ms to minimize.
[2021-05-14 22:39:41] [INFO ] Deduced a trap composed of 75 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:39:42] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:39:42] [INFO ] Deduced a trap composed of 34 places in 413 ms of which 0 ms to minimize.
[2021-05-14 22:39:43] [INFO ] Deduced a trap composed of 71 places in 276 ms of which 1 ms to minimize.
[2021-05-14 22:39:43] [INFO ] Deduced a trap composed of 71 places in 274 ms of which 1 ms to minimize.
[2021-05-14 22:39:43] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 0 ms to minimize.
[2021-05-14 22:39:44] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 0 ms to minimize.
[2021-05-14 22:39:44] [INFO ] Deduced a trap composed of 128 places in 263 ms of which 1 ms to minimize.
[2021-05-14 22:39:44] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 1 ms to minimize.
[2021-05-14 22:39:45] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 0 ms to minimize.
[2021-05-14 22:39:45] [INFO ] Deduced a trap composed of 109 places in 267 ms of which 1 ms to minimize.
[2021-05-14 22:39:45] [INFO ] Deduced a trap composed of 91 places in 254 ms of which 0 ms to minimize.
[2021-05-14 22:39:46] [INFO ] Deduced a trap composed of 91 places in 254 ms of which 1 ms to minimize.
[2021-05-14 22:39:46] [INFO ] Deduced a trap composed of 99 places in 340 ms of which 1 ms to minimize.
[2021-05-14 22:39:46] [INFO ] Deduced a trap composed of 99 places in 341 ms of which 0 ms to minimize.
[2021-05-14 22:39:47] [INFO ] Deduced a trap composed of 128 places in 338 ms of which 1 ms to minimize.
[2021-05-14 22:39:47] [INFO ] Deduced a trap composed of 128 places in 338 ms of which 1 ms to minimize.
[2021-05-14 22:39:48] [INFO ] Deduced a trap composed of 139 places in 353 ms of which 1 ms to minimize.
[2021-05-14 22:39:48] [INFO ] Deduced a trap composed of 111 places in 347 ms of which 1 ms to minimize.
[2021-05-14 22:39:48] [INFO ] Deduced a trap composed of 111 places in 337 ms of which 0 ms to minimize.
[2021-05-14 22:39:49] [INFO ] Deduced a trap composed of 110 places in 343 ms of which 0 ms to minimize.
[2021-05-14 22:39:49] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 0 ms to minimize.
[2021-05-14 22:39:50] [INFO ] Deduced a trap composed of 30 places in 373 ms of which 1 ms to minimize.
[2021-05-14 22:39:50] [INFO ] Deduced a trap composed of 92 places in 295 ms of which 1 ms to minimize.
[2021-05-14 22:39:50] [INFO ] Deduced a trap composed of 110 places in 204 ms of which 0 ms to minimize.
[2021-05-14 22:39:51] [INFO ] Deduced a trap composed of 110 places in 203 ms of which 1 ms to minimize.
[2021-05-14 22:39:51] [INFO ] Deduced a trap composed of 106 places in 226 ms of which 20 ms to minimize.
[2021-05-14 22:39:51] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 0 ms to minimize.
[2021-05-14 22:39:51] [INFO ] Deduced a trap composed of 106 places in 215 ms of which 1 ms to minimize.
[2021-05-14 22:39:52] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 1 ms to minimize.
[2021-05-14 22:39:52] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:39:53] [INFO ] Deduced a trap composed of 132 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:39:53] [INFO ] Deduced a trap composed of 88 places in 357 ms of which 1 ms to minimize.
[2021-05-14 22:39:54] [INFO ] Deduced a trap composed of 156 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:39:54] [INFO ] Deduced a trap composed of 94 places in 365 ms of which 1 ms to minimize.
[2021-05-14 22:39:54] [INFO ] Deduced a trap composed of 74 places in 361 ms of which 1 ms to minimize.
[2021-05-14 22:39:55] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 1 ms to minimize.
[2021-05-14 22:39:55] [INFO ] Deduced a trap composed of 84 places in 363 ms of which 1 ms to minimize.
[2021-05-14 22:39:56] [INFO ] Deduced a trap composed of 68 places in 360 ms of which 1 ms to minimize.
[2021-05-14 22:39:56] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 1 ms to minimize.
[2021-05-14 22:39:56] [INFO ] Deduced a trap composed of 86 places in 363 ms of which 1 ms to minimize.
[2021-05-14 22:39:57] [INFO ] Deduced a trap composed of 88 places in 300 ms of which 1 ms to minimize.
[2021-05-14 22:39:57] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:39:57] [INFO ] Deduced a trap composed of 128 places in 206 ms of which 0 ms to minimize.
[2021-05-14 22:39:57] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 35245 ms
[2021-05-14 22:39:58] [INFO ] Computed and/alt/rep : 1758/4958/1758 causal constraints (skipped 112 transitions) in 97 ms.
[2021-05-14 22:40:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 588900 steps, including 1000 resets, run finished after 3264 ms. (steps per millisecond=180 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA Peterson-PT-7-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 531 out of 1110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1110/1110 places, 2214/2214 transitions.
Applied a total of 0 rules in 60 ms. Remains 1110 /1110 variables (removed 0) and now considering 2214/2214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2214/2214 transitions.
Starting structural reductions, iteration 0 : 1110/1110 places, 2214/2214 transitions.
Applied a total of 0 rules in 61 ms. Remains 1110 /1110 variables (removed 0) and now considering 2214/2214 (removed 0) transitions.
[2021-05-14 22:40:10] [INFO ] Flow matrix only has 1878 transitions (discarded 336 similar events)
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:40:10] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-14 22:40:10] [INFO ] Implicit Places using invariants in 347 ms returned []
[2021-05-14 22:40:10] [INFO ] Flow matrix only has 1878 transitions (discarded 336 similar events)
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:40:10] [INFO ] Computed 31 place invariants in 11 ms
[2021-05-14 22:40:11] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:40:14] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2021-05-14 22:40:14] [INFO ] Redundant transitions in 116 ms returned []
[2021-05-14 22:40:14] [INFO ] Flow matrix only has 1878 transitions (discarded 336 similar events)
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:40:14] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-14 22:40:15] [INFO ] Dead Transitions using invariants and state equation in 992 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1110/1110 places, 2214/2214 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2021-05-14 22:40:16] [INFO ] Flow matrix only has 1878 transitions (discarded 336 similar events)
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:40:16] [INFO ] Computed 31 place invariants in 5 ms
[2021-05-14 22:40:16] [INFO ] [Real]Absence check using 23 positive place invariants in 47 ms returned sat
[2021-05-14 22:40:16] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 25 ms returned sat
[2021-05-14 22:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:40:22] [INFO ] [Real]Absence check using state equation in 5904 ms returned sat
[2021-05-14 22:40:22] [INFO ] State equation strengthened by 546 read => feed constraints.
[2021-05-14 22:40:22] [INFO ] [Real]Added 546 Read/Feed constraints in 94 ms returned sat
[2021-05-14 22:40:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:40:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2021-05-14 22:40:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 27 ms returned sat
[2021-05-14 22:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:40:28] [INFO ] [Nat]Absence check using state equation in 5384 ms returned sat
[2021-05-14 22:40:28] [INFO ] [Nat]Added 546 Read/Feed constraints in 108 ms returned sat
[2021-05-14 22:40:29] [INFO ] Deduced a trap composed of 44 places in 427 ms of which 0 ms to minimize.
[2021-05-14 22:40:29] [INFO ] Deduced a trap composed of 44 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:40:30] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 1 ms to minimize.
[2021-05-14 22:40:30] [INFO ] Deduced a trap composed of 18 places in 462 ms of which 0 ms to minimize.
[2021-05-14 22:40:31] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 1 ms to minimize.
[2021-05-14 22:40:31] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 1 ms to minimize.
[2021-05-14 22:40:32] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:40:32] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:40:33] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 1 ms to minimize.
[2021-05-14 22:40:33] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 0 ms to minimize.
[2021-05-14 22:40:34] [INFO ] Deduced a trap composed of 44 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:40:34] [INFO ] Deduced a trap composed of 74 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:40:35] [INFO ] Deduced a trap composed of 44 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:40:35] [INFO ] Deduced a trap composed of 40 places in 446 ms of which 1 ms to minimize.
[2021-05-14 22:40:36] [INFO ] Deduced a trap composed of 40 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:40:36] [INFO ] Deduced a trap composed of 22 places in 437 ms of which 1 ms to minimize.
[2021-05-14 22:40:37] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:40:37] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:40:38] [INFO ] Deduced a trap composed of 34 places in 434 ms of which 0 ms to minimize.
[2021-05-14 22:40:38] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 0 ms to minimize.
[2021-05-14 22:40:39] [INFO ] Deduced a trap composed of 48 places in 407 ms of which 0 ms to minimize.
[2021-05-14 22:40:39] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2021-05-14 22:40:40] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:40:40] [INFO ] Deduced a trap composed of 62 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:40:41] [INFO ] Deduced a trap composed of 48 places in 431 ms of which 1 ms to minimize.
[2021-05-14 22:40:41] [INFO ] Deduced a trap composed of 48 places in 413 ms of which 1 ms to minimize.
[2021-05-14 22:40:42] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:40:42] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 1 ms to minimize.
[2021-05-14 22:40:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-14 22:40:42] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2021-05-14 22:40:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:40:43] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2021-05-14 22:40:43] [INFO ] [Real]Added 546 Read/Feed constraints in 70 ms returned sat
[2021-05-14 22:40:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:40:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:40:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:40:44] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2021-05-14 22:40:44] [INFO ] [Nat]Added 546 Read/Feed constraints in 83 ms returned sat
[2021-05-14 22:40:44] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 0 ms to minimize.
[2021-05-14 22:40:45] [INFO ] Deduced a trap composed of 12 places in 421 ms of which 0 ms to minimize.
[2021-05-14 22:40:45] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 0 ms to minimize.
[2021-05-14 22:40:46] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:40:46] [INFO ] Deduced a trap composed of 38 places in 422 ms of which 1 ms to minimize.
[2021-05-14 22:40:47] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 1 ms to minimize.
[2021-05-14 22:40:47] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:40:48] [INFO ] Deduced a trap composed of 52 places in 424 ms of which 1 ms to minimize.
[2021-05-14 22:40:48] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 1 ms to minimize.
[2021-05-14 22:40:48] [INFO ] Deduced a trap composed of 16 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:40:49] [INFO ] Deduced a trap composed of 22 places in 427 ms of which 1 ms to minimize.
[2021-05-14 22:40:49] [INFO ] Deduced a trap composed of 70 places in 414 ms of which 0 ms to minimize.
[2021-05-14 22:40:50] [INFO ] Deduced a trap composed of 75 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:40:50] [INFO ] Deduced a trap composed of 79 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:40:51] [INFO ] Deduced a trap composed of 50 places in 404 ms of which 0 ms to minimize.
[2021-05-14 22:40:51] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:40:52] [INFO ] Deduced a trap composed of 79 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:40:52] [INFO ] Deduced a trap composed of 64 places in 408 ms of which 1 ms to minimize.
[2021-05-14 22:40:53] [INFO ] Deduced a trap composed of 60 places in 403 ms of which 0 ms to minimize.
[2021-05-14 22:40:53] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 1 ms to minimize.
[2021-05-14 22:40:54] [INFO ] Deduced a trap composed of 60 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:40:54] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 1 ms to minimize.
[2021-05-14 22:40:55] [INFO ] Deduced a trap composed of 20 places in 451 ms of which 1 ms to minimize.
[2021-05-14 22:40:55] [INFO ] Deduced a trap composed of 56 places in 415 ms of which 1 ms to minimize.
[2021-05-14 22:40:56] [INFO ] Deduced a trap composed of 56 places in 417 ms of which 1 ms to minimize.
[2021-05-14 22:40:56] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 0 ms to minimize.
[2021-05-14 22:40:57] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:40:57] [INFO ] Deduced a trap composed of 56 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:40:57] [INFO ] Deduced a trap composed of 66 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:40:58] [INFO ] Deduced a trap composed of 82 places in 427 ms of which 0 ms to minimize.
[2021-05-14 22:40:58] [INFO ] Deduced a trap composed of 56 places in 429 ms of which 1 ms to minimize.
[2021-05-14 22:40:59] [INFO ] Deduced a trap composed of 262 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:40:59] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:41:00] [INFO ] Deduced a trap composed of 92 places in 420 ms of which 1 ms to minimize.
[2021-05-14 22:41:00] [INFO ] Deduced a trap composed of 58 places in 436 ms of which 0 ms to minimize.
[2021-05-14 22:41:01] [INFO ] Deduced a trap composed of 92 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:41:01] [INFO ] Deduced a trap composed of 78 places in 422 ms of which 0 ms to minimize.
[2021-05-14 22:41:02] [INFO ] Deduced a trap composed of 74 places in 416 ms of which 0 ms to minimize.
[2021-05-14 22:41:02] [INFO ] Deduced a trap composed of 92 places in 421 ms of which 1 ms to minimize.
[2021-05-14 22:41:03] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:41:03] [INFO ] Deduced a trap composed of 56 places in 428 ms of which 1 ms to minimize.
[2021-05-14 22:41:03] [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 22:41:03] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:41:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:04] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2021-05-14 22:41:04] [INFO ] [Real]Added 546 Read/Feed constraints in 66 ms returned sat
[2021-05-14 22:41:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:41:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:41:04] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:05] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2021-05-14 22:41:05] [INFO ] [Nat]Added 546 Read/Feed constraints in 78 ms returned sat
[2021-05-14 22:41:05] [INFO ] Deduced a trap composed of 130 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:41:06] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2021-05-14 22:41:06] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 0 ms to minimize.
[2021-05-14 22:41:06] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:41:07] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 1 ms to minimize.
[2021-05-14 22:41:07] [INFO ] Deduced a trap composed of 50 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:41:08] [INFO ] Deduced a trap composed of 46 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:41:08] [INFO ] Deduced a trap composed of 50 places in 415 ms of which 1 ms to minimize.
[2021-05-14 22:41:09] [INFO ] Deduced a trap composed of 30 places in 444 ms of which 1 ms to minimize.
[2021-05-14 22:41:09] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:41:10] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:41:10] [INFO ] Deduced a trap composed of 12 places in 407 ms of which 0 ms to minimize.
[2021-05-14 22:41:11] [INFO ] Deduced a trap composed of 62 places in 410 ms of which 0 ms to minimize.
[2021-05-14 22:41:11] [INFO ] Deduced a trap composed of 18 places in 405 ms of which 1 ms to minimize.
[2021-05-14 22:41:12] [INFO ] Deduced a trap composed of 102 places in 372 ms of which 1 ms to minimize.
[2021-05-14 22:41:12] [INFO ] Deduced a trap composed of 102 places in 370 ms of which 1 ms to minimize.
[2021-05-14 22:41:12] [INFO ] Deduced a trap composed of 48 places in 370 ms of which 1 ms to minimize.
[2021-05-14 22:41:13] [INFO ] Deduced a trap composed of 58 places in 401 ms of which 1 ms to minimize.
[2021-05-14 22:41:13] [INFO ] Deduced a trap composed of 48 places in 402 ms of which 1 ms to minimize.
[2021-05-14 22:41:14] [INFO ] Deduced a trap composed of 58 places in 402 ms of which 1 ms to minimize.
[2021-05-14 22:41:14] [INFO ] Deduced a trap composed of 48 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:41:15] [INFO ] Deduced a trap composed of 48 places in 402 ms of which 1 ms to minimize.
[2021-05-14 22:41:15] [INFO ] Deduced a trap composed of 58 places in 401 ms of which 1 ms to minimize.
[2021-05-14 22:41:16] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 1 ms to minimize.
[2021-05-14 22:41:16] [INFO ] Deduced a trap composed of 56 places in 396 ms of which 0 ms to minimize.
[2021-05-14 22:41:16] [INFO ] Deduced a trap composed of 94 places in 395 ms of which 1 ms to minimize.
[2021-05-14 22:41:17] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 1 ms to minimize.
[2021-05-14 22:41:17] [INFO ] Deduced a trap composed of 74 places in 394 ms of which 1 ms to minimize.
[2021-05-14 22:41:18] [INFO ] Deduced a trap composed of 108 places in 394 ms of which 1 ms to minimize.
[2021-05-14 22:41:18] [INFO ] Deduced a trap composed of 165 places in 393 ms of which 1 ms to minimize.
[2021-05-14 22:41:19] [INFO ] Deduced a trap composed of 38 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:41:19] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 0 ms to minimize.
[2021-05-14 22:41:20] [INFO ] Deduced a trap composed of 36 places in 408 ms of which 1 ms to minimize.
[2021-05-14 22:41:20] [INFO ] Deduced a trap composed of 38 places in 388 ms of which 1 ms to minimize.
[2021-05-14 22:41:20] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 0 ms to minimize.
[2021-05-14 22:41:21] [INFO ] Deduced a trap composed of 84 places in 335 ms of which 1 ms to minimize.
[2021-05-14 22:41:21] [INFO ] Deduced a trap composed of 84 places in 338 ms of which 1 ms to minimize.
[2021-05-14 22:41:22] [INFO ] Deduced a trap composed of 84 places in 335 ms of which 1 ms to minimize.
[2021-05-14 22:41:22] [INFO ] Deduced a trap composed of 102 places in 336 ms of which 0 ms to minimize.
[2021-05-14 22:41:22] [INFO ] Deduced a trap composed of 120 places in 340 ms of which 0 ms to minimize.
[2021-05-14 22:41:23] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 1 ms to minimize.
[2021-05-14 22:41:23] [INFO ] Deduced a trap composed of 66 places in 337 ms of which 0 ms to minimize.
[2021-05-14 22:41:24] [INFO ] Deduced a trap composed of 84 places in 333 ms of which 0 ms to minimize.
[2021-05-14 22:41:24] [INFO ] Deduced a trap composed of 66 places in 316 ms of which 0 ms to minimize.
[2021-05-14 22:41:25] [INFO ] Deduced a trap composed of 2 places in 538 ms of which 1 ms to minimize.
[2021-05-14 22:41:25] [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 22:41:25] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:41:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:25] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2021-05-14 22:41:25] [INFO ] [Real]Added 546 Read/Feed constraints in 71 ms returned sat
[2021-05-14 22:41:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:41:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:41:26] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:26] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2021-05-14 22:41:26] [INFO ] [Nat]Added 546 Read/Feed constraints in 82 ms returned sat
[2021-05-14 22:41:26] [INFO ] Deduced a trap composed of 43 places in 364 ms of which 1 ms to minimize.
[2021-05-14 22:41:27] [INFO ] Deduced a trap composed of 62 places in 369 ms of which 1 ms to minimize.
[2021-05-14 22:41:27] [INFO ] Deduced a trap composed of 62 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:41:28] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:41:28] [INFO ] Deduced a trap composed of 62 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:41:29] [INFO ] Deduced a trap composed of 62 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:41:29] [INFO ] Deduced a trap composed of 92 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:41:29] [INFO ] Deduced a trap composed of 20 places in 369 ms of which 1 ms to minimize.
[2021-05-14 22:41:30] [INFO ] Deduced a trap composed of 16 places in 369 ms of which 0 ms to minimize.
[2021-05-14 22:41:30] [INFO ] Deduced a trap composed of 30 places in 379 ms of which 0 ms to minimize.
[2021-05-14 22:41:31] [INFO ] Deduced a trap composed of 38 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:41:31] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:41:32] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:41:32] [INFO ] Deduced a trap composed of 62 places in 368 ms of which 1 ms to minimize.
[2021-05-14 22:41:32] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 1 ms to minimize.
[2021-05-14 22:41:33] [INFO ] Deduced a trap composed of 198 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:41:33] [INFO ] Deduced a trap composed of 205 places in 409 ms of which 0 ms to minimize.
[2021-05-14 22:41:34] [INFO ] Deduced a trap composed of 156 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:41:34] [INFO ] Deduced a trap composed of 154 places in 406 ms of which 1 ms to minimize.
[2021-05-14 22:41:35] [INFO ] Deduced a trap composed of 176 places in 410 ms of which 1 ms to minimize.
[2021-05-14 22:41:35] [INFO ] Deduced a trap composed of 58 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:41:36] [INFO ] Deduced a trap composed of 62 places in 419 ms of which 1 ms to minimize.
[2021-05-14 22:41:36] [INFO ] Deduced a trap composed of 20 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:41:37] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 0 ms to minimize.
[2021-05-14 22:41:37] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2021-05-14 22:41:37] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 1 ms to minimize.
[2021-05-14 22:41:38] [INFO ] Deduced a trap composed of 74 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:41:38] [INFO ] Deduced a trap composed of 74 places in 407 ms of which 1 ms to minimize.
[2021-05-14 22:41:39] [INFO ] Deduced a trap composed of 62 places in 407 ms of which 0 ms to minimize.
[2021-05-14 22:41:39] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:41:40] [INFO ] Deduced a trap composed of 65 places in 393 ms of which 0 ms to minimize.
[2021-05-14 22:41:40] [INFO ] Deduced a trap composed of 70 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:41:41] [INFO ] Deduced a trap composed of 65 places in 390 ms of which 1 ms to minimize.
[2021-05-14 22:41:41] [INFO ] Deduced a trap composed of 87 places in 398 ms of which 1 ms to minimize.
[2021-05-14 22:41:42] [INFO ] Deduced a trap composed of 87 places in 393 ms of which 1 ms to minimize.
[2021-05-14 22:41:42] [INFO ] Deduced a trap composed of 102 places in 393 ms of which 1 ms to minimize.
[2021-05-14 22:41:43] [INFO ] Deduced a trap composed of 34 places in 398 ms of which 1 ms to minimize.
[2021-05-14 22:41:43] [INFO ] Deduced a trap composed of 66 places in 399 ms of which 0 ms to minimize.
[2021-05-14 22:41:43] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:41:44] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 1 ms to minimize.
[2021-05-14 22:41:44] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 1 ms to minimize.
[2021-05-14 22:41:45] [INFO ] Deduced a trap composed of 100 places in 391 ms of which 1 ms to minimize.
[2021-05-14 22:41:45] [INFO ] Deduced a trap composed of 82 places in 402 ms of which 1 ms to minimize.
[2021-05-14 22:41:46] [INFO ] Deduced a trap composed of 12 places in 452 ms of which 1 ms to minimize.
[2021-05-14 22:41:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-14 22:41:46] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:41:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-14 22:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:46] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2021-05-14 22:41:47] [INFO ] [Real]Added 546 Read/Feed constraints in 77 ms returned sat
[2021-05-14 22:41:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:41:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2021-05-14 22:41:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:41:47] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2021-05-14 22:41:47] [INFO ] [Nat]Added 546 Read/Feed constraints in 82 ms returned sat
[2021-05-14 22:41:48] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 0 ms to minimize.
[2021-05-14 22:41:48] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 0 ms to minimize.
[2021-05-14 22:41:49] [INFO ] Deduced a trap composed of 38 places in 366 ms of which 1 ms to minimize.
[2021-05-14 22:41:49] [INFO ] Deduced a trap composed of 38 places in 362 ms of which 1 ms to minimize.
[2021-05-14 22:41:50] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 0 ms to minimize.
[2021-05-14 22:41:50] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 1 ms to minimize.
[2021-05-14 22:41:50] [INFO ] Deduced a trap composed of 46 places in 359 ms of which 1 ms to minimize.
[2021-05-14 22:41:51] [INFO ] Deduced a trap composed of 46 places in 360 ms of which 1 ms to minimize.
[2021-05-14 22:41:51] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 1 ms to minimize.
[2021-05-14 22:41:52] [INFO ] Deduced a trap composed of 30 places in 354 ms of which 1 ms to minimize.
[2021-05-14 22:41:52] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2021-05-14 22:41:52] [INFO ] Deduced a trap composed of 66 places in 355 ms of which 1 ms to minimize.
[2021-05-14 22:41:53] [INFO ] Deduced a trap composed of 66 places in 356 ms of which 0 ms to minimize.
[2021-05-14 22:41:53] [INFO ] Deduced a trap composed of 66 places in 352 ms of which 1 ms to minimize.
[2021-05-14 22:41:54] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 0 ms to minimize.
[2021-05-14 22:41:54] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 1 ms to minimize.
[2021-05-14 22:41:54] [INFO ] Deduced a trap composed of 55 places in 343 ms of which 1 ms to minimize.
[2021-05-14 22:41:55] [INFO ] Deduced a trap composed of 24 places in 351 ms of which 1 ms to minimize.
[2021-05-14 22:41:55] [INFO ] Deduced a trap composed of 58 places in 357 ms of which 1 ms to minimize.
[2021-05-14 22:41:56] [INFO ] Deduced a trap composed of 198 places in 353 ms of which 0 ms to minimize.
[2021-05-14 22:41:56] [INFO ] Deduced a trap composed of 24 places in 347 ms of which 1 ms to minimize.
[2021-05-14 22:41:56] [INFO ] Deduced a trap composed of 66 places in 305 ms of which 1 ms to minimize.
[2021-05-14 22:41:57] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 1 ms to minimize.
[2021-05-14 22:41:57] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 1 ms to minimize.
[2021-05-14 22:41:58] [INFO ] Deduced a trap composed of 43 places in 338 ms of which 1 ms to minimize.
[2021-05-14 22:41:58] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 0 ms to minimize.
[2021-05-14 22:41:58] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2021-05-14 22:41:59] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:41:59] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 1 ms to minimize.
[2021-05-14 22:41:59] [INFO ] Deduced a trap composed of 66 places in 286 ms of which 0 ms to minimize.
[2021-05-14 22:42:00] [INFO ] Deduced a trap composed of 94 places in 285 ms of which 1 ms to minimize.
[2021-05-14 22:42:00] [INFO ] Deduced a trap composed of 92 places in 286 ms of which 0 ms to minimize.
[2021-05-14 22:42:00] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 1 ms to minimize.
[2021-05-14 22:42:01] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 0 ms to minimize.
[2021-05-14 22:42:01] [INFO ] Deduced a trap composed of 80 places in 228 ms of which 0 ms to minimize.
[2021-05-14 22:42:01] [INFO ] Deduced a trap composed of 80 places in 229 ms of which 1 ms to minimize.
[2021-05-14 22:42:02] [INFO ] Deduced a trap composed of 82 places in 248 ms of which 0 ms to minimize.
[2021-05-14 22:42:02] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 1 ms to minimize.
[2021-05-14 22:42:02] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2021-05-14 22:42:03] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 0 ms to minimize.
[2021-05-14 22:42:03] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 0 ms to minimize.
[2021-05-14 22:42:04] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 1 ms to minimize.
[2021-05-14 22:42:04] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:42:04] [INFO ] Deduced a trap composed of 62 places in 266 ms of which 1 ms to minimize.
[2021-05-14 22:42:04] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 0 ms to minimize.
[2021-05-14 22:42:05] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 1 ms to minimize.
[2021-05-14 22:42:05] [INFO ] Deduced a trap composed of 95 places in 411 ms of which 0 ms to minimize.
[2021-05-14 22:42:06] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 1 ms to minimize.
[2021-05-14 22:42:06] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 1 ms to minimize.
[2021-05-14 22:42:07] [INFO ] Deduced a trap composed of 73 places in 412 ms of which 1 ms to minimize.
[2021-05-14 22:42: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 4
[2021-05-14 22:42:07] [INFO ] Flatten gal took : 66 ms
[2021-05-14 22:42:07] [INFO ] Flatten gal took : 65 ms
[2021-05-14 22:42:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10502426173705369885.gal : 9 ms
[2021-05-14 22:42:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4203182085409342339.prop : 113 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/ReachabilityCardinality10502426173705369885.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4203182085409342339.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/ReachabilityCardinality10502426173705369885.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4203182085409342339.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4203182085409342339.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 20
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :20 after 21
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :21 after 31
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :31 after 48
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :48 after 71
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :71 after 94
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :94 after 298
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :298 after 699
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :699 after 1559
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1559 after 5550
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :5550 after 13264
Detected timeout of ITS tools.
[2021-05-14 22:42:22] [INFO ] Flatten gal took : 59 ms
[2021-05-14 22:42:22] [INFO ] Applying decomposition
[2021-05-14 22:42:22] [INFO ] Flatten gal took : 59 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/graph15850263753625627820.txt, -o, /tmp/graph15850263753625627820.bin, -w, /tmp/graph15850263753625627820.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/graph15850263753625627820.bin, -l, -1, -v, -w, /tmp/graph15850263753625627820.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:42:22] [INFO ] Decomposing Gal with order
[2021-05-14 22:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:42:23] [INFO ] Removed a total of 2833 redundant transitions.
[2021-05-14 22:42:23] [INFO ] Flatten gal took : 111 ms
[2021-05-14 22:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-14 22:42:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality918277288021019297.gal : 13 ms
[2021-05-14 22:42:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16955385575157077357.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/ReachabilityCardinality918277288021019297.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16955385575157077357.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/ReachabilityCardinality918277288021019297.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16955385575157077357.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16955385575157077357.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 384
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :384 after 384
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16747980888853192604
[2021-05-14 22:42:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16747980888853192604
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/ltsmin16747980888853192604]
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/ltsmin16747980888853192604] 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/ltsmin16747980888853192604] 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)
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1110 transition count 1878
Free-agglomeration rule applied 54 times.
Iterating global reduction 1 with 54 rules applied. Total rules applied 390 place count 1110 transition count 1824
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 444 place count 1056 transition count 1824
Applied a total of 444 rules in 93 ms. Remains 1056 /1110 variables (removed 54) and now considering 1824/2214 (removed 390) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1824 rows 1056 cols
[2021-05-14 22:42:39] [INFO ] Computed 31 place invariants in 4 ms
[2021-05-14 22:42:39] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned sat
[2021-05-14 22:42:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 29 ms returned sat
[2021-05-14 22:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:42:48] [INFO ] [Real]Absence check using state equation in 8861 ms returned sat
[2021-05-14 22:42:48] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 86 ms.
[2021-05-14 22:42:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:42:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2021-05-14 22:42:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 21 ms returned sat
[2021-05-14 22:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:42:58] [INFO ] [Nat]Absence check using state equation in 4836 ms returned sat
[2021-05-14 22:42:58] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 93 ms.
[2021-05-14 22:43:18] [INFO ] Added : 965 causal constraints over 193 iterations in 19348 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-14 22:43:18] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:43:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:18] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2021-05-14 22:43:19] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 89 ms.
[2021-05-14 22:43:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:43:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-14 22:43:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:20] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-14 22:43:20] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 87 ms.
[2021-05-14 22:43:34] [INFO ] Added : 936 causal constraints over 188 iterations in 14055 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-14 22:43:34] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2021-05-14 22:43:34] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:35] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-14 22:43:35] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 85 ms.
[2021-05-14 22:43:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:43:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:43:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:38] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2021-05-14 22:43:38] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 87 ms.
[2021-05-14 22:43:46] [INFO ] Added : 587 causal constraints over 118 iterations in 8131 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-14 22:43:46] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2021-05-14 22:43:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:47] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-14 22:43:47] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 86 ms.
[2021-05-14 22:43:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:43:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:43:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 22:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:43:50] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2021-05-14 22:43:50] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 85 ms.
[2021-05-14 22:44:02] [INFO ] Added : 821 causal constraints over 165 iterations in 11895 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 22:44:02] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2021-05-14 22:44:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 16 ms returned sat
[2021-05-14 22:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 22:44:03] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2021-05-14 22:44:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 22:44:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2021-05-14 22:44:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 22:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 22:44:03] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2021-05-14 22:44:04] [INFO ] Computed and/alt/rep : 1704/4169/1704 causal constraints (skipped 112 transitions) in 87 ms.
[2021-05-14 22:44:15] [INFO ] Added : 819 causal constraints over 164 iterations in 11995 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 22:44:16] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12326622098771755248
[2021-05-14 22:44:16] [INFO ] Too many transitions (2214) to apply POR reductions. Disabling POR matrices.
[2021-05-14 22:44:16] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12326622098771755248
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/ltsmin12326622098771755248]
[2021-05-14 22:44:16] [INFO ] Flatten gal took : 118 ms
[2021-05-14 22:44:16] [INFO ] Applying decomposition
[2021-05-14 22:44:16] [INFO ] Flatten gal took : 97 ms
[2021-05-14 22:44:16] [INFO ] Input system was already deterministic with 2214 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/graph5283037300244553563.txt, -o, /tmp/graph5283037300244553563.bin, -w, /tmp/graph5283037300244553563.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/graph5283037300244553563.bin, -l, -1, -v, -w, /tmp/graph5283037300244553563.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 22:44:22] [INFO ] Decomposing Gal with order
[2021-05-14 22:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 22:44:22] [INFO ] Removed a total of 2833 redundant transitions.
[2021-05-14 22:44:22] [INFO ] Flatten gal took : 152 ms
[2021-05-14 22:44:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2021-05-14 22:44:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5053146859469529621.gal : 14 ms
[2021-05-14 22:44:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability624211516299364462.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/ReachabilityFireability5053146859469529621.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability624211516299364462.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/ReachabilityFireability5053146859469529621.gal -t CGAL -reachable-file /tmp/ReachabilityFireability624211516299364462.prop --nowitness
[2021-05-14 22:44:23] [INFO ] Ran tautology test, simplified 0 / 5 in 6812 ms.
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-05(UNSAT) depth K=0 took 55 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=0 took 2 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=0 took 2 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-15(UNSAT) depth K=0 took 1 ms
Loading property file /tmp/ReachabilityFireability624211516299364462.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1878 out of 2214 initially.
// Phase 1: matrix 1878 rows 1110 cols
[2021-05-14 22:44:23] [INFO ] Computed 31 place invariants in 9 ms
inv : WantSection_5_F - Idle_5 = 0
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_6_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_6_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_5_2 + IsEndLoop_3_4_2 + IsEndLoop_3_6_2 + IsEndLoop_3_1_4 + IsEndLoop_3_0_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + IsEndLoop_3_6_4 + IsEndLoop_3_0_5 + IsEndLoop_3_4_4 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_4_5 + IsEndLoop_3_1_5 + IsEndLoop_3_2_5 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + IsEndLoop_3_5_5 + IsEndLoop_3_6_5 + IsEndLoop_3_4_6 + IsEndLoop_3_5_6 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_2_7 + IsEndLoop_3_1_7 + IsEndLoop_3_0_7 + IsEndLoop_3_6_6 + IsEndLoop_3_6_7 + IsEndLoop_3_5_7 + IsEndLoop_3_4_7 + IsEndLoop_3_3_7 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + BeginLoop_3_0_0 + EndTurn_3_6 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_5_0 + BeginLoop_3_6_0 + BeginLoop_3_1_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_4_0 + TestAlone_3_0_1 + TestAlone_3_5_0 + TestAlone_3_6_0 + TestAlone_3_4_0 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_4_2 + TestAlone_3_3_2 + TestAlone_3_6_2 + TestAlone_3_5_2 + TestAlone_3_2_1 + TestAlone_3_1_1 + TestAlone_3_4_1 + TestAlone_3_3_1 + TestAlone_3_6_1 + TestAlone_3_0_2 + TestAlone_3_5_1 + TestAlone_3_2_2 + TestAlone_3_1_2 + TestAlone_3_0_5 + TestAlone_3_1_5 + TestAlone_3_2_5 + TestAlone_3_4_5 + TestAlone_3_3_5 + TestAlone_3_5_5 + TestAlone_3_6_5 + TestAlone_3_0_6 + TestAlone_3_1_6 + TestAlone_3_0_4 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestAlone_3_4_4 + TestAlone_3_5_4 + TestAlone_3_6_4 + TestTurn_3_1 + TestTurn_3_0 + TestAlone_3_6_7 + TestAlone_3_5_7 + TestAlone_3_4_7 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestAlone_3_6_6 + TestAlone_3_4_6 + TestAlone_3_5_6 + TestAlone_3_3_6 + TestAlone_3_2_6 + TestAlone_3_3_7 + TestAlone_3_2_7 + TestAlone_3_1_7 + TestAlone_3_0_7 + TestIdentity_3_0_2 + TestTurn_3_6 + TestIdentity_3_6_3 + TestIdentity_3_6_4 + CS_3 + AskForSection_3_5 + AskForSection_3_6 + AskForSection_3_3 + AskForSection_3_4 + AskForSection_3_1 + AskForSection_3_2 + Idle_3 + AskForSection_3_0 = 1
inv : Turn_5_6 + Turn_5_5 + Turn_5_4 + Turn_5_3 + Turn_5_2 + Turn_5_0 + Turn_5_1 + Turn_5_7 = 1
inv : IsEndLoop_7_0_0 + IsEndLoop_7_1_0 + IsEndLoop_7_2_0 + IsEndLoop_7_3_0 + IsEndLoop_7_4_0 + IsEndLoop_7_5_0 + IsEndLoop_7_6_0 + IsEndLoop_7_0_1 + IsEndLoop_7_1_1 + IsEndLoop_7_2_1 + IsEndLoop_7_3_1 + IsEndLoop_7_4_1 + IsEndLoop_7_5_1 + IsEndLoop_7_6_1 + IsEndLoop_7_0_2 + IsEndLoop_7_2_2 + IsEndLoop_7_1_2 + IsEndLoop_7_4_2 + IsEndLoop_7_3_2 + IsEndLoop_7_6_2 + IsEndLoop_7_5_2 + IsEndLoop_7_1_3 + IsEndLoop_7_0_3 + IsEndLoop_7_3_3 + IsEndLoop_7_2_3 + IsEndLoop_7_5_3 + IsEndLoop_7_4_3 + IsEndLoop_7_0_4 + IsEndLoop_7_6_3 + IsEndLoop_7_2_4 + IsEndLoop_7_1_4 + IsEndLoop_7_5_4 + IsEndLoop_7_6_4 + IsEndLoop_7_3_4 + IsEndLoop_7_4_4 + IsEndLoop_7_2_5 + IsEndLoop_7_3_5 + IsEndLoop_7_0_5 + IsEndLoop_7_1_5 + IsEndLoop_7_6_5 + IsEndLoop_7_0_6 + IsEndLoop_7_4_5 + IsEndLoop_7_5_5 + IsEndLoop_7_3_6 + IsEndLoop_7_4_6 + IsEndLoop_7_1_6 + IsEndLoop_7_2_6 + IsEndLoop_7_1_7 + IsEndLoop_7_0_7 + IsEndLoop_7_6_6 + IsEndLoop_7_5_6 + IsEndLoop_7_5_7 + IsEndLoop_7_4_7 + IsEndLoop_7_3_7 + IsEndLoop_7_2_7 + EndTurn_7_2 + EndTurn_7_1 + EndTurn_7_0 + IsEndLoop_7_6_7 + EndTurn_7_6 + EndTurn_7_5 + EndTurn_7_4 + EndTurn_7_3 + BeginLoop_7_4_0 + BeginLoop_7_5_0 + BeginLoop_7_6_0 + BeginLoop_7_0_0 + BeginLoop_7_1_0 + BeginLoop_7_2_0 + BeginLoop_7_3_0 + BeginLoop_7_3_1 + TestAlone_7_6_0 + TestAlone_7_5_0 + TestAlone_7_4_0 + TestAlone_7_3_0 + TestAlone_7_1_0 + TestAlone_7_2_0 + TestAlone_7_0_0 + TestAlone_7_4_2 + TestAlone_7_3_2 + TestAlone_7_2_2 + TestAlone_7_6_2 + TestAlone_7_5_2 + TestAlone_7_1_3 + TestAlone_7_0_3 + TestAlone_7_3_3 + TestAlone_7_2_3 + TestAlone_7_1_1 + TestAlone_7_0_1 + TestAlone_7_4_1 + TestAlone_7_2_1 + TestAlone_7_3_1 + TestAlone_7_6_1 + TestAlone_7_5_1 + TestAlone_7_1_2 + TestAlone_7_0_2 + TestAlone_7_0_5 + TestAlone_7_1_5 + TestAlone_7_2_5 + TestAlone_7_3_5 + TestAlone_7_4_5 + TestAlone_7_5_5 + TestAlone_7_0_6 + TestAlone_7_6_5 + TestAlone_7_1_6 + TestAlone_7_4_3 + TestAlone_7_5_3 + TestAlone_7_6_3 + TestAlone_7_0_4 + TestAlone_7_1_4 + TestAlone_7_2_4 + TestAlone_7_3_4 + TestAlone_7_4_4 + TestAlone_7_5_4 + TestAlone_7_6_4 + TestTurn_7_0 + TestTurn_7_4 + TestTurn_7_3 + TestTurn_7_2 + TestTurn_7_1 + TestAlone_7_5_6 + TestAlone_7_4_6 + TestAlone_7_3_6 + TestAlone_7_2_6 + TestAlone_7_6_6 + TestIdentity_7_3_1 + TestTurn_7_5 + TestTurn_7_6 + AskForSection_7_6 + CS_7 + AskForSection_7_4 + AskForSection_7_5 + AskForSection_7_2 + AskForSection_7_3 + AskForSection_7_0 + AskForSection_7_1 + Idle_7 = 1
inv : Turn_1_7 + Turn_1_6 + Turn_1_4 + Turn_1_5 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 = 1
inv : Turn_2_7 + Turn_2_5 + Turn_2_6 + Turn_2_4 + Turn_2_3 + Turn_2_2 + Turn_2_1 + Turn_2_0 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : WantSection_2_T + Idle_2 = 1
inv : WantSection_6_T + Idle_6 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_6_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_6_1 + IsEndLoop_5_0_2 + IsEndLoop_5_2_2 + IsEndLoop_5_1_2 + IsEndLoop_5_4_2 + IsEndLoop_5_3_2 + IsEndLoop_5_6_2 + IsEndLoop_5_5_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_0_4 + IsEndLoop_5_6_3 + IsEndLoop_5_2_4 + IsEndLoop_5_1_4 + IsEndLoop_5_5_4 + IsEndLoop_5_6_4 + IsEndLoop_5_3_4 + IsEndLoop_5_4_4 + IsEndLoop_5_0_6 + IsEndLoop_5_3_6 + IsEndLoop_5_4_6 + IsEndLoop_5_1_6 + IsEndLoop_5_2_6 + IsEndLoop_5_1_7 + IsEndLoop_5_0_7 + IsEndLoop_5_6_6 + IsEndLoop_5_5_6 + IsEndLoop_5_5_7 + IsEndLoop_5_4_7 + IsEndLoop_5_3_7 + IsEndLoop_5_2_7 + EndTurn_5_2 + EndTurn_5_1 + EndTurn_5_0 + IsEndLoop_5_6_7 + EndTurn_5_6 + EndTurn_5_5 + EndTurn_5_4 + EndTurn_5_3 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_6_0 + BeginLoop_5_0_0 + BeginLoop_5_1_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + BeginLoop_5_6_6 + TestAlone_5_6_0 + TestAlone_5_5_0 + TestAlone_5_4_0 + TestAlone_5_3_0 + TestAlone_5_2_0 + TestAlone_5_1_0 + TestAlone_5_0_0 + TestAlone_5_4_2 + TestAlone_5_3_2 + TestAlone_5_6_2 + TestAlone_5_5_2 + TestAlone_5_1_3 + TestAlone_5_0_3 + TestAlone_5_4_3 + TestAlone_5_3_3 + TestAlone_5_2_3 + TestAlone_5_2_1 + TestAlone_5_0_1 + TestAlone_5_1_1 + TestAlone_5_4_1 + TestAlone_5_3_1 + TestAlone_5_6_1 + TestAlone_5_5_1 + TestAlone_5_1_2 + TestAlone_5_2_2 + TestAlone_5_0_2 + TestAlone_5_0_6 + TestAlone_5_1_6 + TestAlone_5_5_3 + TestAlone_5_6_3 + TestAlone_5_0_4 + TestAlone_5_1_4 + TestAlone_5_2_4 + TestAlone_5_3_4 + TestAlone_5_4_4 + TestAlone_5_5_4 + TestAlone_5_6_4 + TestTurn_5_0 + TestAlone_5_6_7 + TestAlone_5_5_7 + TestAlone_5_4_7 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestAlone_5_5_6 + TestAlone_5_4_6 + TestAlone_5_3_6 + TestAlone_5_2_6 + TestAlone_5_3_7 + TestAlone_5_2_7 + TestAlone_5_1_7 + TestAlone_5_6_6 + TestAlone_5_0_7 + TestTurn_5_5 + TestTurn_5_6 + TestIdentity_5_6_6 + AskForSection_5_6 + CS_5 + AskForSection_5_4 + AskForSection_5_5 + AskForSection_5_2 + AskForSection_5_3 + AskForSection_5_0 + AskForSection_5_1 + Idle_5 = 1
inv : Turn_3_6 + Turn_3_7 + Turn_3_5 + Turn_3_4 + Turn_3_3 + Turn_3_2 + Turn_3_1 + Turn_3_0 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_5_1 + IsEndLoop_0_6_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_3_2 + IsEndLoop_0_2_2 + IsEndLoop_0_5_2 + IsEndLoop_0_4_2 + IsEndLoop_0_0_3 + IsEndLoop_0_6_2 + IsEndLoop_0_2_3 + IsEndLoop_0_1_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_6_3 + IsEndLoop_0_5_3 + IsEndLoop_0_1_4 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_2_4 + IsEndLoop_0_6_4 + IsEndLoop_0_0_5 + IsEndLoop_0_4_4 + IsEndLoop_0_5_4 + IsEndLoop_0_3_5 + IsEndLoop_0_4_5 + IsEndLoop_0_1_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_1_6 + IsEndLoop_0_5_5 + IsEndLoop_0_6_5 + IsEndLoop_0_4_6 + IsEndLoop_0_5_6 + IsEndLoop_0_2_6 + IsEndLoop_0_3_6 + IsEndLoop_0_2_7 + IsEndLoop_0_1_7 + IsEndLoop_0_0_7 + IsEndLoop_0_6_6 + IsEndLoop_0_6_7 + IsEndLoop_0_5_7 + IsEndLoop_0_4_7 + IsEndLoop_0_3_7 + EndTurn_0_3 + EndTurn_0_2 + EndTurn_0_1 + EndTurn_0_0 + BeginLoop_0_0_0 + EndTurn_0_6 + EndTurn_0_5 + EndTurn_0_4 + BeginLoop_0_5_0 + BeginLoop_0_6_0 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_3_0 + BeginLoop_0_4_0 + TestAlone_0_0_1 + TestAlone_0_4_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_6_2 + TestAlone_0_5_2 + TestAlone_0_2_3 + TestAlone_0_1_3 + TestAlone_0_4_3 + TestAlone_0_3_3 + TestAlone_0_2_1 + TestAlone_0_1_1 + TestAlone_0_4_1 + TestAlone_0_5_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_6_1 + TestAlone_0_2_2 + TestAlone_0_1_2 + TestAlone_0_1_5 + TestAlone_0_0_5 + TestAlone_0_2_5 + TestAlone_0_3_5 + TestAlone_0_4_5 + TestAlone_0_5_5 + TestAlone_0_6_5 + TestAlone_0_0_6 + TestAlone_0_2_6 + TestAlone_0_1_6 + TestAlone_0_5_3 + TestAlone_0_6_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestAlone_0_4_4 + TestAlone_0_5_4 + TestAlone_0_6_4 + TestTurn_0_1 + TestTurn_0_0 + TestAlone_0_6_7 + TestAlone_0_5_7 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestAlone_0_6_6 + TestAlone_0_5_6 + TestAlone_0_4_6 + TestAlone_0_3_6 + TestAlone_0_4_7 + TestAlone_0_2_7 + TestAlone_0_3_7 + TestAlone_0_1_7 + TestAlone_0_0_7 + TestTurn_0_6 + CS_0 + AskForSection_0_5 + AskForSection_0_6 + AskForSection_0_3 + AskForSection_0_4 + AskForSection_0_1 + AskForSection_0_2 + Idle_0 + AskForSection_0_0 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : Turn_0_7 + Turn_0_6 + Turn_0_5 + Turn_0_3 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_0 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : WantSection_7_T + Idle_7 = 1
inv : WantSection_6_F - Idle_6 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_6_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_6_1 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_1_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_6_3 + IsEndLoop_2_5_3 + IsEndLoop_2_1_4 + IsEndLoop_2_0_4 + IsEndLoop_2_3_4 + IsEndLoop_2_2_4 + IsEndLoop_2_6_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_4_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_5_5 + IsEndLoop_2_6_5 + IsEndLoop_2_4_6 + IsEndLoop_2_5_6 + IsEndLoop_2_2_6 + IsEndLoop_2_3_6 + IsEndLoop_2_2_7 + IsEndLoop_2_1_7 + IsEndLoop_2_0_7 + IsEndLoop_2_6_6 + IsEndLoop_2_6_7 + IsEndLoop_2_5_7 + IsEndLoop_2_4_7 + IsEndLoop_2_3_7 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + BeginLoop_2_0_0 + EndTurn_2_6 + EndTurn_2_5 + EndTurn_2_4 + BeginLoop_2_5_0 + BeginLoop_2_6_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_4_0 + TestAlone_2_0_1 + TestAlone_2_6_0 + TestAlone_2_4_0 + TestAlone_2_5_0 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_2_3 + TestAlone_2_1_3 + TestAlone_2_0_3 + TestAlone_2_4_3 + TestAlone_2_3_3 + TestAlone_2_2_1 + TestAlone_2_1_1 + TestAlone_2_4_1 + TestAlone_2_3_1 + TestAlone_2_5_1 + TestAlone_2_6_1 + TestAlone_2_0_5 + TestAlone_2_1_5 + TestAlone_2_3_5 + TestAlone_2_2_5 + TestAlone_2_4_5 + TestAlone_2_5_5 + TestAlone_2_6_5 + TestAlone_2_0_6 + TestAlone_2_1_6 + TestAlone_2_5_3 + TestAlone_2_6_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestAlone_2_4_4 + TestAlone_2_5_4 + TestAlone_2_6_4 + TestTurn_2_1 + TestTurn_2_0 + TestAlone_2_6_7 + TestAlone_2_5_7 + TestAlone_2_4_7 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestAlone_2_6_6 + TestAlone_2_5_6 + TestAlone_2_3_6 + TestAlone_2_4_6 + TestAlone_2_2_6 + TestAlone_2_3_7 + TestAlone_2_2_7 + TestAlone_2_1_7 + TestAlone_2_0_7 + TestTurn_2_6 + CS_2 + AskForSection_2_5 + AskForSection_2_6 + AskForSection_2_3 + AskForSection_2_4 + AskForSection_2_1 + AskForSection_2_2 + Idle_2 + AskForSection_2_0 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_6_0 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_3_2 + IsEndLoop_1_2_2 + IsEndLoop_1_5_2 + IsEndLoop_1_4_2 + IsEndLoop_1_0_3 + IsEndLoop_1_6_2 + IsEndLoop_1_2_3 + IsEndLoop_1_1_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_6_3 + IsEndLoop_1_5_3 + IsEndLoop_1_1_4 + IsEndLoop_1_0_4 + IsEndLoop_1_3_4 + IsEndLoop_1_2_4 + IsEndLoop_1_6_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_5_4 + IsEndLoop_1_3_5 + IsEndLoop_1_4_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_5_5 + IsEndLoop_1_6_5 + IsEndLoop_1_4_6 + IsEndLoop_1_5_6 + IsEndLoop_1_2_6 + IsEndLoop_1_3_6 + IsEndLoop_1_2_7 + IsEndLoop_1_1_7 + IsEndLoop_1_0_7 + IsEndLoop_1_6_6 + IsEndLoop_1_6_7 + IsEndLoop_1_5_7 + IsEndLoop_1_4_7 + IsEndLoop_1_3_7 + EndTurn_1_3 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + BeginLoop_1_0_0 + EndTurn_1_6 + EndTurn_1_5 + EndTurn_1_4 + BeginLoop_1_5_0 + BeginLoop_1_6_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_4_0 + TestAlone_1_6_0 + TestAlone_1_5_0 + TestAlone_1_3_0 + TestAlone_1_4_0 + TestAlone_1_2_0 + TestAlone_1_1_0 + TestAlone_1_0_0 + TestAlone_1_4_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_6_2 + TestAlone_1_5_2 + TestAlone_1_2_3 + TestAlone_1_1_3 + TestAlone_1_4_3 + TestAlone_1_3_3 + TestAlone_1_0_2 + TestAlone_1_2_2 + TestAlone_1_1_2 + TestAlone_1_0_5 + TestAlone_1_2_5 + TestAlone_1_1_5 + TestAlone_1_3_5 + TestAlone_1_4_5 + TestAlone_1_5_5 + TestAlone_1_6_5 + TestAlone_1_0_6 + TestAlone_1_1_6 + TestAlone_1_5_3 + TestAlone_1_6_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestAlone_1_4_4 + TestAlone_1_5_4 + TestAlone_1_6_4 + TestTurn_1_1 + TestTurn_1_0 + TestAlone_1_6_7 + TestAlone_1_5_7 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestAlone_1_6_6 + TestAlone_1_5_6 + TestAlone_1_4_6 + TestAlone_1_2_6 + TestAlone_1_3_6 + TestAlone_1_3_7 + TestAlone_1_4_7 + TestAlone_1_2_7 + TestAlone_1_1_7 + TestAlone_1_0_7 + TestTurn_1_6 + CS_1 + AskForSection_1_5 + AskForSection_1_6 + AskForSection_1_3 + AskForSection_1_4 + AskForSection_1_1 + AskForSection_1_2 + Idle_1 + AskForSection_1_0 = 1
inv : WantSection_7_F - Idle_7 = 0
inv : Turn_6_6 + Turn_6_5 + Turn_6_4 + Turn_6_3 + Turn_6_1 + Turn_6_2 + Turn_6_0 + Turn_6_7 = 1
inv : WantSection_4_T + Idle_4 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_6_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_3_1 + IsEndLoop_6_4_1 + IsEndLoop_6_5_1 + IsEndLoop_6_6_1 + IsEndLoop_6_0_2 + IsEndLoop_6_2_2 + IsEndLoop_6_1_2 + IsEndLoop_6_4_2 + IsEndLoop_6_3_2 + IsEndLoop_6_6_2 + IsEndLoop_6_5_2 + IsEndLoop_6_1_3 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_0_4 + IsEndLoop_6_6_3 + IsEndLoop_6_2_4 + IsEndLoop_6_1_4 + IsEndLoop_6_5_4 + IsEndLoop_6_6_4 + IsEndLoop_6_3_4 + IsEndLoop_6_4_4 + IsEndLoop_6_2_5 + IsEndLoop_6_3_5 + IsEndLoop_6_0_5 + IsEndLoop_6_1_5 + IsEndLoop_6_6_5 + IsEndLoop_6_4_5 + IsEndLoop_6_5_5 + IsEndLoop_6_1_7 + IsEndLoop_6_0_7 + IsEndLoop_6_5_7 + IsEndLoop_6_4_7 + IsEndLoop_6_3_7 + IsEndLoop_6_2_7 + EndTurn_6_2 + EndTurn_6_1 + EndTurn_6_0 + IsEndLoop_6_6_7 + EndTurn_6_6 + EndTurn_6_5 + EndTurn_6_4 + EndTurn_6_3 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_6_0 + BeginLoop_6_0_0 + BeginLoop_6_1_0 + BeginLoop_6_2_0 + BeginLoop_6_3_0 + TestAlone_6_6_0 + TestAlone_6_5_0 + TestAlone_6_4_0 + TestAlone_6_3_0 + TestAlone_6_2_0 + TestAlone_6_0_0 + TestAlone_6_1_0 + TestAlone_6_4_2 + TestAlone_6_3_2 + TestAlone_6_2_2 + TestAlone_6_6_2 + TestAlone_6_5_2 + TestAlone_6_1_3 + TestAlone_6_0_3 + TestAlone_6_4_3 + TestAlone_6_3_3 + TestAlone_6_2_3 + TestAlone_6_1_1 + TestAlone_6_2_1 + TestAlone_6_0_1 + TestAlone_6_4_1 + TestAlone_6_3_1 + TestAlone_6_6_1 + TestAlone_6_5_1 + TestAlone_6_1_2 + TestAlone_6_0_2 + TestAlone_6_0_5 + TestAlone_6_1_5 + TestAlone_6_2_5 + TestAlone_6_3_5 + TestAlone_6_4_5 + TestAlone_6_6_5 + TestAlone_6_5_5 + TestAlone_6_5_3 + TestAlone_6_6_3 + TestAlone_6_0_4 + TestAlone_6_1_4 + TestAlone_6_2_4 + TestAlone_6_3_4 + TestAlone_6_4_4 + TestAlone_6_5_4 + TestAlone_6_6_4 + TestTurn_6_0 + TestAlone_6_6_7 + TestAlone_6_5_7 + TestAlone_6_4_7 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestAlone_6_3_7 + TestAlone_6_2_7 + TestAlone_6_0_7 + TestAlone_6_1_7 + TestTurn_6_5 + TestTurn_6_6 + AskForSection_6_6 + CS_6 + AskForSection_6_4 + AskForSection_6_5 + AskForSection_6_2 + AskForSection_6_3 + AskForSection_6_0 + AskForSection_6_1 + Idle_6 = 1
inv : WantSection_5_T + Idle_5 = 1
inv : Turn_4_6 + Turn_4_5 + Turn_4_4 + Turn_4_3 + Turn_4_2 + Turn_4_1 + Turn_4_0 + Turn_4_7 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : WantSection_4_F - Idle_4 = 0
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_6_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_6_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_2_2 + IsEndLoop_4_5_2 + IsEndLoop_4_4_2 + IsEndLoop_4_0_3 + IsEndLoop_4_6_2 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_4_3 + IsEndLoop_4_3_3 + IsEndLoop_4_6_3 + IsEndLoop_4_5_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_4_5 + IsEndLoop_4_1_5 + IsEndLoop_4_2_5 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + IsEndLoop_4_5_5 + IsEndLoop_4_6_5 + IsEndLoop_4_4_6 + IsEndLoop_4_5_6 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_2_7 + IsEndLoop_4_1_7 + IsEndLoop_4_0_7 + IsEndLoop_4_6_6 + IsEndLoop_4_6_7 + IsEndLoop_4_5_7 + IsEndLoop_4_4_7 + IsEndLoop_4_3_7 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_6 + EndTurn_4_5 + EndTurn_4_4 + BeginLoop_4_5_0 + BeginLoop_4_6_0 + BeginLoop_4_1_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_4_0 + TestAlone_4_6_0 + TestAlone_4_0_1 + TestAlone_4_5_0 + TestAlone_4_4_0 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_0_0 + TestAlone_4_4_2 + TestAlone_4_3_2 + TestAlone_4_6_2 + TestAlone_4_5_2 + TestAlone_4_2_3 + TestAlone_4_1_3 + TestAlone_4_0_3 + TestAlone_4_4_3 + TestAlone_4_3_3 + TestAlone_4_2_1 + TestAlone_4_1_1 + TestAlone_4_4_1 + TestAlone_4_3_1 + TestAlone_4_6_1 + TestAlone_4_5_1 + TestAlone_4_2_2 + TestAlone_4_0_2 + TestAlone_4_1_2 + TestAlone_4_0_5 + TestAlone_4_1_5 + TestAlone_4_2_5 + TestAlone_4_3_5 + TestAlone_4_5_5 + TestAlone_4_4_5 + TestAlone_4_6_5 + TestAlone_4_0_6 + TestAlone_4_1_6 + TestAlone_4_5_3 + TestAlone_4_6_3 + TestTurn_4_1 + TestTurn_4_0 + TestAlone_4_6_7 + TestAlone_4_5_7 + TestAlone_4_4_7 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestAlone_4_5_6 + TestAlone_4_6_6 + TestAlone_4_4_6 + TestAlone_4_3_6 + TestAlone_4_2_6 + TestAlone_4_3_7 + TestAlone_4_2_7 + TestAlone_4_1_7 + TestAlone_4_0_7 + TestTurn_4_6 + CS_4 + AskForSection_4_5 + AskForSection_4_6 + AskForSection_4_3 + AskForSection_4_4 + AskForSection_4_1 + AskForSection_4_2 + Idle_4 + AskForSection_4_0 = 1
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_1_F - Idle_1 = 0
Total of 31 invariants.
[2021-05-14 22:44:23] [INFO ] Computed 31 place invariants in 12 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 40
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-05(UNSAT) depth K=1 took 712 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=1 took 2 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=1 took 2 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=1 took 2 ms
[2021-05-14 22:44:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-15(UNSAT) depth K=1 took 2 ms
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :40 after 575
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :575 after 1259
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1259 after 6118
[2021-05-14 22:44:26] [INFO ] Proved 1110 variables to be positive in 2770 ms
[2021-05-14 22:44:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-05
[2021-05-14 22:44:26] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-05(SAT) depth K=0 took 209 ms
[2021-05-14 22:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2021-05-14 22:44:27] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=0 took 352 ms
[2021-05-14 22:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2021-05-14 22:44:27] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=0 took 295 ms
[2021-05-14 22:44:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-12
[2021-05-14 22:44:27] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-12(SAT) depth K=0 took 155 ms
[2021-05-14 22:44:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-15
[2021-05-14 22:44:28] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-15(SAT) depth K=0 took 600 ms
[2021-05-14 22:44:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-05
[2021-05-14 22:44:29] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-05(SAT) depth K=1 took 1152 ms
[2021-05-14 22:44:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2021-05-14 22:44:30] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=1 took 971 ms
[2021-05-14 22:44:31] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-05(UNSAT) depth K=2 took 7127 ms
[2021-05-14 22:44:31] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=2 took 853 ms
[2021-05-14 22:44:33] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=2 took 1086 ms
[2021-05-14 22:44:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2021-05-14 22:44:33] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=1 took 2714 ms
[2021-05-14 22:44:33] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=2 took 850 ms
[2021-05-14 22:44:35] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-15(UNSAT) depth K=2 took 2018 ms
[2021-05-14 22:44:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-12
[2021-05-14 22:44:37] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-12(SAT) depth K=1 took 4254 ms
[2021-05-14 22:44:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-15
[2021-05-14 22:44:38] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-15(SAT) depth K=1 took 972 ms
Compilation finished in 25240 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12326622098771755248]
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, PetersonPT7ReachabilityFireability05==true], workingDir=/tmp/ltsmin12326622098771755248]
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6118 after 1.38141e+08
[2021-05-14 22:53:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-05
[2021-05-14 22:53:02] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-05(SAT) depth K=2 took 504116 ms
[2021-05-14 22:54:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2021-05-14 22:54:52] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=2 took 109534 ms
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.38141e+08 after 1.38141e+08
[2021-05-14 22:55:52] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2021-05-14 22:55:52] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=2 took 60927 ms
WARNING : LTSmin timed out (>720 s) on command 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, PetersonPT7ReachabilityFireability05==true], workingDir=/tmp/ltsmin12326622098771755248]
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, PetersonPT7ReachabilityFireability09==true], workingDir=/tmp/ltsmin12326622098771755248]
Detected timeout of ITS tools.
[2021-05-14 23:08:21] [INFO ] Applying decomposition
[2021-05-14 23:08:21] [INFO ] Flatten gal took : 155 ms
[2021-05-14 23:08:21] [INFO ] Decomposing Gal with order
[2021-05-14 23:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:08:21] [INFO ] Removed a total of 2833 redundant transitions.
[2021-05-14 23:08:22] [INFO ] Flatten gal took : 355 ms
[2021-05-14 23:08:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 66 ms.
[2021-05-14 23:08:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7941405488583129486.gal : 44 ms
[2021-05-14 23:08:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4657604524143226488.prop : 20 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/ReachabilityFireability7941405488583129486.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4657604524143226488.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/ReachabilityFireability7941405488583129486.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4657604524143226488.prop --nowitness
Loading property file /tmp/ReachabilityFireability4657604524143226488.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 8696
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8696 after 8696
WARNING : LTSmin timed out (>720 s) on command 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, PetersonPT7ReachabilityFireability09==true], workingDir=/tmp/ltsmin12326622098771755248]
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, PetersonPT7ReachabilityFireability10==true], workingDir=/tmp/ltsmin12326622098771755248]
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8696 after 3.38955e+06
WARNING : LTSmin timed out (>720 s) on command 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, PetersonPT7ReachabilityFireability10==true], workingDir=/tmp/ltsmin12326622098771755248]
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, PetersonPT7ReachabilityFireability12==true], workingDir=/tmp/ltsmin12326622098771755248]
[2021-05-14 23:31:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-12
[2021-05-14 23:31:33] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-12(SAT) depth K=2 took 2140878 ms
Detected timeout of ITS tools.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-7"
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-7, 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-162089128200647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;